#include<bits/stdc++.h>
using namespace std;
int n,m,t,sx,sy,fx,fy;int z,k;
int a[101][101];int ans=0;
void dfs(int x,int y)
{
	if(x==fx&&y==fy)
	{
		ans++;return;
	}
	else
	{
		a[x][y]=0;
		if(a[x+1][y]!=0)
		{
			dfs(x+1,y);a[x+1][y]=1;
		}
		if(a[x][y+1]!=0)
		{
			dfs(x,y+1);a[x][y+1]=1;
		}
		if(a[x-1][y]!=0)
		{
			dfs(x-1,y);a[x-1][y]=1;
		}
		if(a[x][y-1]!=0)
		{
			dfs(x,y-1);a[x][y-1]=1;
		}
	}
}
int main()
{
	memset(a,0,sizeof(a));
	cin>>n>>m>>t;
	cin>>sx>>sy>>fx>>fy;
	for(int i=1;i<=n;i++)
	for(int j=1;i<=m;j++)
	a[i][j]=1;
	for(int i=1;i<=t;i++)
	{
		cin>>z>>k;
		a[z][k]=0;
	}
	dfs(sx,sy);
	cout<<ans<<endl;
	return 0;
}