#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,ans,t,sx,sy,ex,ey,mp[6][6];
void dfs(int x,int y){
	if(x==ex&&y==ey){
		ans++;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				mp[i][j]==0?mp[i][j]=1:mp[i][j]=-1;
			}
		}
	}
	mp[x][y]=0;
	if(mp[x+1][y]==1){
		dfs(x+1,y);
	}
	if(mp[x-1][y]==1){
		dfs(x-1,y);
	}
	if(mp[x][y+1]==1){
		dfs(x,y+1);
	}
	if(mp[x][y-1]==1){
		dfs(x,y-1);
	}
	
} 
signed main(){
	//freopen(".in","r",stdin);freopen(".out","w",stdout);
	cin>>n>>m>>t;
	cin>>sx>>sy>>ex>>ey;
	for(int i=0;i<t;i++){
		int a,b;
		cin>>a>>b;
		mp[a][b]=-1;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			mp[i][j]==0?mp[i][j]=1:mp[i][j]=-1;
		}
	}
	dfs(sx,sy);
	cout<<ans;
	return 0;
	//fclose(stdin);fclose(stdout);
}