#include <bits/stdc++.h>
using namespace std;
int n, m, t, x, y;
int sx, sy, tx, ty;
int dx[4] = {1, -1}, dy[4] = {0, 0, 1, -1};
bool vis[6][6];
int dfs(int x, int y)
{
    if(x == tx && y == ty) return 1;
    int ans = 0;
    for(int i = 0; i < 4; i++)
    {
        int x1 = x + dx[i], y1 = y + dy[i];
        if(x1 < 1 || x1 > n || y1 < 1 || y1 > m) continue;
        if(vis[x1][y1]) continue;
        vis[x1][y1] = true;
        ans += dfs(x1, y1);
        vis[x1][y1] = false;
    }
    return ans;
}
int main()
{
    scanf("%d%d%d%d%d%d%d", &n, &m, &t, &sx, &sy, &tx, &ty);
    while(t--)
    {
        scanf("%d%d", &x, &y);
        vis[x][y] = true;
    }
    printf("%d", dfs(sx, sy));
    return 0;
}