#include<bits/stdc++.h>
using namespace std;
int n,m,t,fx,fy,sx,sy,tx[66],ty[66],sum;
bool bbq[6][6],mp[6][6];
void dafashi(int x,int y)
{
	if(x==n&&y==m)sum++;
	if(bbq[x+1][y]==0&&mp[x+1][y]==1&&x+1<=n)
	{
		bbq[x+1][y]=1;
		dafashi(x+1,y);
		bbq[x+1][y]=0;
	}
	if(bbq[x-1][y]==0&&mp[x-1][y]==1&&x-1>=1)
	{
		bbq[x-1][y]=1;
		dafashi(x-1,y);
		bbq[x-1][y]=0;
	}
	if(bbq[x][y+1]==0&&mp[x][y+1]==1&&y+1<=m)
	{
		bbq[x][y+1]=1;
		dafashi(x,y+1);
		bbq[x][y+1]=0;
	}
	if(bbq[x][y-1]==0&&mp[x][y-1]==1&&y-1>=1)
	{
		bbq[x][y-1]=1;
		dafashi(x,y-1);
		bbq[x][y-1]=0;
	}
	//story return
}
int main()
{
	cin>>n>>m>>t;
	cin>>sx>>sy>>fx>>fy;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)mp[i][j]=1;
	}
	for(int i=0;i<t;i++)
	{
		cin>>tx[i]>>ty[i];
		mp[tx[i]][ty[i]]=0;
	}
	dafashi(sx,sy);
	cout<<sum;
    return 0;
}//DGuru using dzd to ak ioi