#include<bits/stdc++.h>
using namespace std;
int a[19][19];
int b[19][19];
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int bx,by,ex,ey;
int sum;
void dfs(int x,int y){
	if(x == ex && y == ey){
		//cout << endl;
		sum++;
		return;
	}
	for(int i=0;i<4;i++){
		int tx;
		int ty;
		tx = x + dx[i];
		ty = y + dy[i];
		
		if(a[tx][ty] == 1 && b[tx][ty] != 1){
			b[tx][ty] = 1;
			//cout << x << " " << y << endl;
			dfs(tx,ty);
			b[tx][ty] = 0;
		}
	}
}
int main(){
	int n,m,t;
	cin >> n >> m >> t;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			a[i][j] = 1;
		}
	}
	cin >> bx >> by >> ex >> ey;
	b[bx][by] = 1;
	for(int i=0;i<t;i++){
		int zx,zy;
		cin >> zx >> zy;
		a[zx][zy] = 0;
		b[zx][zy] = 1;
	}
	dfs(1,1);
	cout << sum;
}