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