#include<bits/stdc++.h>
using namespace std;
int N,M,T,sx,sy,fx,fy,bx,by;
int ans;
int a[10][10];
void search(int x,int y)
{
	if(x==fx&&y==fy)
	{
		ans++;
		return;
	}
	if(a[x-1][y]==0) search(x-1,y);
	if(a[x+1][y]==0) search(x+1,y);
	if(a[x][y-1]==0) search(x,y-1);
	if(a[x][y-1]==0) search(x,y-1);
	return;			
}
int main()
{
	cin>>N>>M>>T;
	cin>>sx>>sy>>fx>>fy;
    for(int i=0;i<T;i++)
    {
    	cin>>bx>>by;
    	a[bx][by]=1;
    }
    search(sx,sy);
    cout<<ans<<endl;
    return 0;
}