#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;
const int N = 6;
int n, m, t;
int sx, sy, fx, fy;
bool obs[N][N];
int cnt;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

void dfs (int x, int y)
{
    if (x == fx && y == fy)
    {
        cnt ++;
        return;
    }
    
    for (int i=0; i < 4; i ++)
    {
        int a = x + dx[i], b = y + dy[i];
        if (a < 1 || a > n || b < 1 || b > m || obs[a][b]) continue;
        obs[a][b] = true;
        dfs (a, b);
        obs[a][b] = false;
    }
}

int main()
{
    cin >> n >> m >> t;
    cin >> sx >> sy >> fx >> fy;
    memset (obs, false, sizeof(obs));
    
    while (t --)
    {
        int a, b;
        cin >> a >> b;
        obs[a][b] = true;
    }
    dfs (sx, sy);
    cout << cnt << endl;
    return 0;
}