#include<bits/stdc++.h>
using namespace std;
int a[10][10];
bool f[10][10];
int ans=0;
int n,m,t,x2,y2;
int d[4][2]={-1,0,0,1,1,0,0,-1};
void dfs(int x,int y){
	if(x==x2&&y==y2){
		ans++;
		return ;
	}
	for(int i=0;i<=3;i++){
		int dx=x+d[i][0];
		int dy=y+d[i][1];
		if(dx<1||dx>n||dy<1||dy>m) continue;
		if(f[dx][dy]==1) continue;
		if(a[dx][dy]==1) continue;
		f[dx][dy]=1;
		dfs(dx,dy);
		f[dx][dy]=0;
	}
}
int main(){
	int x1,y1;
	cin>>n>>m>>t>>x1>>y1>>x2>>y2;
	memset(a,0,sizeof(a));
	for(int i=1;i<=t;i++){
		int x,y;
		cin>>x>>y;
		a[x][y]=1;
	}
	dfs(x1,y1);
	cout<<ans;
	return 0;
}