#include<iostream>
using namespace std;
int sum = 0;
int n, m,fx,fy;
int book[6][6];
void dfs(int x,int y)
{
	if (x == fx && y == fy) {
		sum++; 
	return; }
	int move[4][2] = { {0,1},{1,0},{0, -1},{-1,0} };
	for (int i = 0; i < 4; i++)
	{
		int xt = x + move[i][0];
		int yt = y + move[i][1];
		if (xt <1 || yt <1 || xt > n || yt > m|| book[xt][yt])
			continue;
		book[xt][yt] = 1;
		dfs(xt, yt);
		book[xt][yt] = 0;
	}
	return;
}
int main()
{
	int p, q, t,tx,ty;
	cin >> n >> m>>t;
	cin >> p >> q;
	cin >> fx >> fy;
	for (int i = 1; i <= t; ++i)
	{
		cin >> tx >> ty;
		book[tx][ty] = 1;
	}
	dfs(p, q);
	cout << sum;
}