#include<iostream>
using namespace std;
int n, m, t, sx, sy, fx, fy,res;
const int N = 100;
int mp[N][N],vis[N][N];
int xx[] = { 1,0,-1,0 };
int yy[] = { 0,1,0,-1 };
void dfs(int x, int y)
{
if (x == fx && y == fy)
{
res++;
return;
}
for (int i = 0; i < 4; i++)//上下左右跑
{
int dx = xx[i] + x;
int dy = yy[i] + y;
//判断行走可能遇到的所有条件
if (dx >= 1 && dx <= n && dy >= 1 && dy <= m && !mp[dx][dy] && !vis[dx][dy])
{
vis[dx][dy] = 1;
dfs(dx, dy);
vis[dx][dy] = 0;
}
}
}
int main()
{
cin >> n >> m >> t >> sx >> sy >> fx >> fy;
for (int i = 1; i <= t; i++)
{
int x, y;
cin >> x >> y;
mp[x][y] = 1;
}
//上面是预处理
vis[sx][sy] = 1;
dfs(sx, sy);
cout << res;
return 0;
}