#include<bits/stdc++.h>
#define N 2005
#define re 
#define ll long long
using namespace std;
int n,m,K,q,T;
inline void Rd(int &res){
    re char c;res=0;
    while(c=getchar(),c<48);
    do res=(res<<3)+(res<<1)+(c^48);
    while(c=getchar(),c>47);
}
struct node{
    int x,y;
};
bool mk[N][N];
void Clear(){
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++)mk[i][j]=0;
}
node Q[N*N];
bool pd(int x,int y){
    if(mk[x][y])return 0;
    if(x<1||x>n||y<1||y>m)return 0;
    int s=  (mk[x-1][y]|mk[x+1][y]) + (mk[x][y-1]|mk[x][y+1]);
    return s==2;
}
int Solve(int x,int y){
    int l=0,r=0;
    Q[++r]=(node){x,y};
    mk[x][y]=1;
    int ans=1;
    while(l<r){
        int x=Q[++l].x;
        int y=Q[l].y;
        if(pd(x-1,y))mk[x-1][y]=1,ans++,Q[++r]=(node){x-1,y};
        if(pd(x+1,y))mk[x+1][y]=1,ans++,Q[++r]=(node){x+1,y};
        if(pd(x,y-1))mk[x][y-1]=1,ans++,Q[++r]=(node){x,y-1};
        if(pd(x,y+1))mk[x][y+1]=1,ans++,Q[++r]=(node){x,y+1};

    }

    return ans;
}
int main(){
    Rd(T);
    while(T--){
        Rd(n);Rd(m);Rd(K);
        
        while(K--){
            int x,y;
            scanf("%d%d",&x,&y);
            if(mk[x][y]){
                puts("0");
                continue;
            }
            int res=Solve(x,y);
            printf("%d\n",res);

        }


        Clear();
    }
    return 0;
}