#include <iostream>
using namespace std;
int n,m,t,fx,fy,sx,sy,ans;
bool mig[50][50];
int di[4][2]={
	{-1,0},
	{0,-1},
	{0,1},
	{1,0}
};
void dfs(int x,int y);
signed main(){
	scanf("%d %d %d",&n,&m,&t);
	scanf("%d %d %d %d",&sx,&sy,&fx,&fy);
	sx--,sy--,fx--,fy--;
	while(t--){
		int x,y;
		scanf("%d %d",&x,&y);
		mig[x][y]=1;
	}
	dfs(sx,sy);
	cout << ans;
} 
void dfs(int x,int y){
	if(x==fx&&y==fy){
		ans++;
		return;
	}else{
		for(int i=0;i<4;i++){
			int nx=x+di[i][0];
			int ny=y+di[i][1];
			if(nx<0||ny<0||nx>=n||ny>=m)continue;
			if(!mig[nx][ny])continue;
			mig[nx][ny]=1;
			dfs(nx,ny);
			mig[nx][ny]=0;
		}
	}
	
}