题解++;

#include<bits/stdc++.h>
using namespace std;
int n,m,t,j,p[6][6],book[6][6];
int sx,sy,fx,fy;
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
void dfs(int x,int y)
{
    if(x==fx&&y==fy)
    {
        j++;
        return;
    }
 
    for(int i=0;i<=3;i++)
    {
        int nx=x+dir[i][0];
        int ny=y+dir[i][1];
        if(ny<1||ny>n||nx<1||nx>m)
            continue;
        if(book[ny][nx]==1||p[ny][nx]==1)
            continue;
        book[ny][nx]=1;
        dfs(nx,ny);
        book[ny][nx]=0;
    }
}
int main()
{
    cin>>n>>m>>t;
    cin>>sx>>sy>>fx>>fy;
    for(int i=1;i<=t;i++)
    {
        int lx,ly;
        cin>>lx>>ly;
        p[ly][lx]=1;
    }
    book[sy][sx]=1;
    dfs(sx,sy);
    cout<<j;
}