#include<bits/stdc++.h>
using namespace std;
int mapp[11][11];
int n,m,p,sx,sy,fx,fy,sum;
int dx[4]={1,1,-1,-1};
int dy[4]={1,-1,1,-1};
bool ext(int a,int b){
	return a>0&&a<=n&&b>0&&b<=m;
}
void dfs(int x,int y){
	if(x==fx&&y==fy){
		sum++;
		return;
	}
	for(int i=0;i<4;i++){
		if(ext(x+dx[i],y+dy[i])&&mapp[x+dx[i]][y+dy[i]]==0){
			mapp[x+dx[i]][y+dy[i]]=1;
			x+=dx[i];
			y+=dy[i];
			dfs(x,y);
			x-=dx[i];
			y-=dy[i];
			mapp[x+dx[i]][y+dy[i]]=0;
		}
	} 
}
int main(){
	memset(mapp,0,sizeof(mapp));
	cin>>n>>m>>p>>sx>>sy>>fx>>fy;
	int a,b;
	for(int i=1;i<=p;i++){
		cin>>a>>b;
		mapp[a][b]=1;
	}
	dfs(sx,sy);
	cout<<sum;
	return 0;
}