#include<bits/stdc++.h>
using namespace std;
int n,m,a[55][55]={},vis[55][55]={},t,sx,sy,fx,fy,lx,ly,sum=0;
bool cheak(int x,int y){
	if(x>=sx&&x<=fx&&y>=sy&&y<=fy)return true;
	else return false;
}
void dfs(int x,int y){
	if(x==fx&&y==fy){
		sum++;
		return;
	}
	if(!cheak(x,y))return;
	if(!vis[x+1][y]){
		vis[x+1][y]=1;
		dfs(x+1,y);
		vis[x+1][y]=0;
	}
	if(!vis[x-1][y]){
		vis[x-1][y]=1;
		dfs(x-1,y);
		vis[x-1][y]=0;
	}
	if(!vis[x][y+1]){
		vis[x][y+1]=1;
		dfs(x,y+1);
		vis[x][y+1]=0;
	}
	if(!vis[x][y-1]){
		vis[x][y-1]=1;
		dfs(x,y-1);
		vis[x][y-1]=0;
	}
}
int main(){
	cin >> n >> m >> t >> sx >> sy >> fx >> fy;
	for(int i=0;i<t;i++){
		cin >> lx >> ly;
		vis[lx][ly]=1;
	}
	dfs(sx,sy);
	cout << sum << endl;
	return 0;
}