#pragma GCC optimizeA("Ofast")
#pragma GCC optimizeA("inline")
#pragma GCC optimizeA("unroll-loops")

#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }
using namespace std;
const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
const int N=2000,M=2000;
bool dropped[N+10][M+10];
queue<pair<int,int> >Q;

int n,m,q;
bool chk(int x,int y){
    if(dropped[x][y])return 0;
    if(x<1||x>n||y<1||y>m)return 0;
    int cnt1=0,cnt2=0;
    rep(k,0,3){
        int tx=x+dir[k][0];
        int ty=y+dir[k][1];
        if(k<=1){
            cnt1+=dropped[tx][ty];
        }else{
            cnt2+=dropped[tx][ty];
        }
    }
    return (cnt1&&cnt2);
}
int main()
{
    // freopen("1.in", "r", stdin);
    ios::sync_with_stdio(false); cin.tie(nullptr);

    
    int T;
    cin>>T;
    while(T--){
        cin>>n>>m>>q;
        rep(i,1,n){
            rep(j,1,m){
                dropped[i][j]=0;
            }
        }

        rep(i,1,q){
            int x,y;
            cin>>x>>y;
            if(dropped[x][y]){
                cout<<0<<endl;
                continue;
            }

            int cnt=0;
            Q.push(make_pair(x,y));
            dropped[x][y]=1;
            while(!Q.empty()){
                cnt++;
                auto p=Q.front();
                Q.pop();
                
                rep(k,0,3){
                    int x=p.first+dir[k][0];
                    int y=p.second+dir[k][1];
                    if(chk(x,y)){
                        Q.push(make_pair(x,y));
                        dropped[x][y]=1;
                    }
                }
            }
            cout<<cnt<<endl;
        }
        
    }
    return 0;
}