#include<bits/stdc++.h>
using namespace std;
int maze[10][10],ans;
bool a[10][10];
int n,m,t,sx,sy,fx,fy,x,y;
void dfs(int X,int Y){
	if (X==fx&&Y==fy){
		ans++;
		return;
	}
	for (int i=sx,j=sy;i<n&&j<m;i++,j++){
		if (maze[i][j]==0&&a[i][j]==0){
			a[i][j]=1;
			dfs (X-1,Y);
			dfs (X+1,Y);
			dfs (X,Y-1);
			dfs (X,Y+1);
			a[i][j]=0;
		}
	}
}
int main(){
	cin>>n>>m>>t;
	cin>>sx>>sy>>fx>>fy;
	for (int i=1;i<=t;i++){
		cin>>x>>y;
		maze[x][y]=1;
	}
	dfs (sx,sy);
	cout<<ans;
	return 0;
}