#include <bits/stdc++.h>
using namespace std;
int n,m,t,sx,sy,fx,fy,r[10][10],sum=0,f[4][2]={{1,0},{0,1},{-1,0},{0,-1}};

void search(int x,int y) {
	if (r[x][y]==-2) {
		sum++;
	} 
	else if(r[x][y]!=-1){
		r[x][y]=-1;
		for (int i = 0; i < 4; i++) {
			search(x+f[i][0],y+f[i][1]);
		}
		r[x][y]=0;
	}
}

int main() {
	int x,y;
	cin >> n>>m>>t>>sx>>sy>>fx>>fy;
	for (int i = 0; i <= n+1; i++){
		r[i][0]=r[i][m+1]=-1;
	}
	for (int i = 0; i <= m+1; i++){
		r[0][i]=r[n+1][i]=-1;
	}
	for (int i = 1; i <= t; i++){
		cin>>x>>y;
		r[x][y]=-1;
	}
	r[fx][fy]=-2;
	search(sx,sy);
	cout<<sum;
	return 0;
}