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

#2#6#7#8没过