#include<bits/stdc++.h>
using namespace std;
int n,m,t,ans=0;
int startx,starty,endx,endy;
bool s[10][10];
int dx[5]={0,1,-1,0,0};
int dy[5]={0,0,0,1,-1};
struct M
{
    int x,y;
    bool vis=0;
    M(){}
    M(int a,int b):x(a),y(b){}
}pre[10][10];
bool In(int x,int y)
{
    return (x>0&&x<=n&&y>0&&y<=m);
}
void bfs()
{
    queue<M>q;
    M start(startx,starty);
    q.push(start);
    pre[startx][starty].vis=1;
    while(!q.empty())
    {
        M cur=q.front();
        q.pop();
        if(cur.x==endx&&cur.y==endy){
            ans++;q.pop();continue;}
        for(int i=1;i<=4;i++)
        {
            int xx=cur.x+dx[i];
            int yy=cur.y+dy[i];
            if(In(xx,yy)&&pre[xx][yy].vis==0&&s[xx][yy]==0)
            {
                M now(xx,yy);
                q.push(now);
                pre[xx][yy].x=cur.x;
                pre[xx][yy].y=cur.y;
                pre[xx][yy].x=1;
            }
        }

    }

}
int main()
{
    scanf("%d %d %d",&n,&m,&t);
    scanf("%d %d %d %d",&startx,&starty,&endx,&endy);
    for(int i=1;i<=t;++i)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        s[x][y]=1;
        if(endx==x&&endy==y){printf("0");return 0;}
    }
    bfs();
    printf("%d",ans);
    return 0;
}