#include<bits/stdc++.h>
using namespace std;
int n,m,t;
int s[6][6],vis[6][6];
int sx,sy,fx,fy;
int DFS(int x,int y){
	int ans=0;
	vis[x][y]=1;
	if(vis[x][y]!=0)return s[x][y];
	if(x==fx&&y==fy){
		ans++;s[x][y]=ans;return s[x][y];
	}
	if(s[x][y]==-1)return 0;
	if(x+1<=n&&!s[x+1][y])ans+=DFS(x+1,y);
	if(y+1<=m&&!s[x][y+1])ans+=DFS(x,y+1);
	if(x-1>=1&&!s[x-1][y])ans+=DFS(x-1,y);
	if(y-1>=1&&!s[x][y-1])ans+=DFS(x,y-1);
	s[x][y]+=ans;
	return s[x][y];
}
int main(){
	cin>>n>>m>>t;
	cin>>sx>>sy>>fx>>fy;
	int a,b;
	while(t--){
		cin>>a>>b;
		s[a][b]=-1;
	}
	cout<<DFS(sx,sy);
}