#include <stdio.h>
#include <iostream>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
using namespace std;
#define inf 0xfffffff
struct point1
{
int Len,p[201];
}dp[210][210],head1,tail2;
int a[210][210];
int lei[210][210];
int T,x,y,N,M,m;
int fx[4][2]={1,0,0,1,-1,0,0,-1};
int dis[210][210];
int c[210][210];
int maxx;
struct point
{
int x1,y1;
point(){}
point(int l,int w):x1(l),y1(w){}
}head,tail;
int bd(int l,int w)
{
if(l<0||w<0||l>=201||w>=201)
return 1;
else
return 0;
}
void bfs()
{
queue<point>q;
q.push(point(x,y));
memset(dis,inf,sizeof(inf));
memset(c,0,sizeof(c));
dis[x][y]=0;
c[x][y]=1;
while(!q.empty())
{
head=q.front();
q.pop();
int x2,y2;
for(int i=0;i<4;i++)
{
x2=head.x1+fx[i][0];
y2=head.y1+fx[i][1];
if(bd(x2,y2)||c[x2][y2]||!lei[x2][y2])
continue;
c[x2][y2]=1;
dis[x2][y2]=dis[head.x1][head.y1]+1;
q.push(point(x2,y2));
}
}
}
point1 cal(point1 l1,point1 w1)
{
point1 lww;
int maxn=max(l1.Len,w1.Len);
int lw=0;
for(int i=1;i<=maxn;i++)
{
lww.p[i]=l1.p[i]+w1.p[i]+lw;
lw=lww.p[i]/10000;
lww.p[i]=lww.p[i]%10000;
}
if(lw!=0)
{
lww.p[maxn+1]=lw;
lww.Len=maxn+1;
return lww;
}
else
{
lww.Len=maxn;
return lww;
}
}
point1 dfs(int x1,int y1)
{
if(c[x1][y1]!=0)
return dp[x1][y1];
c[x1][y1]=1;
int ans=0;
for(int i=0;i<4;i++)
{// printf("ss\n");
int tx=x1+fx[i][0];
int ty=y1+fx[i][1];
if(bd(tx,ty)||!lei[tx][ty]||dis[tx][ty]>maxx)
continue;
if(dis[tx][ty]==dis[x1][y1]+1)
{
tail2=dfs(tx,ty);
dp[x1][y1]=cal(tail2,dp[x1][y1]);
}
}
return dp[x1][y1];
}
int main()
{
int l,w;
scanf("%d",&T);
while(T--)
{
memset(lei,1,sizeof(lei));
scanf("%d%d%d%d",&x,&y,&N,&M);
scanf("%d",&m);
int flagg=0;
for(int j=0;j<m;j++)
{
scanf("%d%d",&l,&w);
if(l==x&&y==w)
flagg=1;
lei[l][w]=0;
for(int i=0;i<4;i++)
{
int x1=l+fx[i][0];
int y1=w+fx[i][1];
if(!bd(x1,y1))
{
lei[x1][y1]=0;
}
}
}
if(x==N&&y==M)
{
printf("1\n");
continue;
}
maxx=abs(N-x)+abs(M-y);//小细节错误坑到死
bfs();
if(dis[N][M]!=maxx||flagg)
{
printf("0\n");
continue;
}
memset(c,0,sizeof(c));
memset(dp,0,sizeof(dp));
dp[N][M].Len=1;
dp[N][M].p[1]=1;
head1=dfs(x,y);
printf("%d",head1.p[head1.Len]);
for(int i=head1.Len-1;i>=1;i--)
printf("%.4d",head1.p[i]);
printf("\n");
}
}