#include<iostream>
using namespace std;
int n,m,t;
unsigned long long ans=0;
int sx,sy,fx,fy;
int xx,xy;
int tmp[10][10];
bool a[10][10];
void dfs(int i,int j){
	if(i<1||i>n||j<1||j>m){
		return;
	}
	if(i==fx&&j==fy){
		ans++;
		return;
	}
	if(!a[i][j-1]&&!tmp[i][j-1]){
		a[i][j-1]=1;
		dfs(i,j-1);
		a[i][j-1]=0;
	}
	if(!a[i][j+1]&&!tmp[i][j+1]){
			a[i][j+1]=1;
			dfs(i,j+1);
			a[i][j+1]=0;
	}
	if(!a[i-1][j]&&!tmp[i-1][j]){
			a[i-1][j]=1;
			dfs(i-1,j);
			a[i-1][j]=0;
	}
	if(!a[i+1][j]&&!tmp[i+1][j]){
			a[i+1][j]=1;
			dfs(i+1,j);
			a[i+1][j]=0;
	}
}
int main(){
	cin>>n>>m>>t;
	cin>>sx>>sy>>fx>>fy;
	for(int i=1;i<=t;i++){
		cin>>xx>>xy;
		tmp[xx][xy]=1;
	}
	dfs(sx,sy);
	cout<<ans<<endl;
	return 0;
}