#include<bits/stdc++.h>

using namespace std;

int a,b,c,d,e,m1,n1,m2,n2,f,g=0;

int B1[4]= {0,1,0,-1};

int B2[4]= {-1,0,1,0};

int A[100][100]= {0};

int M[100][100]={0};

void dfs(int m1,int n1) {

    if(m1==m2&&n1==n2) {

        

        g++;

        return;

    }

    for(int k=0; k<4; k++) {

        

        if(1<=m1+B1[k]&&m1+B1[k]<=a&&1<=n1+B2[k]&&n1+B2[k]<=b&&A[m1+B1[k]][n1+B2[k]]!=1&&M[m1+B1[k]][n1+B2[k]]!=1) {

            

            M[m1][n1]=1;

            dfs(m1+B1[k],n1+B2[k]);

            M[m1][n1]=0;

        }

    }

}

int main() {

    scanf("%d %d %d %d %d %d %d",&a,&b,&c,&m1,&n1,&m2,&n2);

    for(d=0; d<c; d++) {

        scanf("%d %d",&e,&f);

        A[e][f]=1;

    }

    A[m1][n1]=1;

    dfs(m1,n1);

    

    printf("%d",g);

    return 0;

}