#include <bits/stdc++.h>

using namespace std;

#define boost ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define F first
#define S second


typedef long long ll;
ll R,C,K;

ll grid[3001][3001];
ll dp[3001][3001];


ll ans ;

int main(){
  boost;

  ll tt,T,i,j,k;
  cin >> T;
  for(tt = 1 ; tt <= T ; tt++){
    ans = 0;
    cin >> R >> C >> K;
    memset(grid,0,sizeof(grid));
    for(i = 0 ; i <= 3000 ; i++){
      for(j = 0 ; j <= 3000 ; j++)
       dp[i][j] = 0;
    }

    for(i = 0 ; i < K ; i++){
      ll r,c;
      cin >> r >> c;
      grid[r][c] = 1;
    }

    for(i = 0 ; i < C ; i++){
      if(grid[0][i] == 0)
        dp[0][i] = 1;
      else 
        dp[0][i] = 0;
    }

    for(i = 1 ; i < R ; i++){
      if(grid[i][0] == 0)
        dp[i][0] = 1;
      else 
        dp[i][0] = 0;
    }

    for(i = 1 ; i < R ; i++){
      for(j = 1 ; j < C ; j++){
        if(grid[i][j] == 0)
          dp[i][j] = min(dp[i][j-1],min(dp[i-1][j],dp[i-1][j-1]))+1;
        else 
          dp[i][j] = 0;
      }
    }
    for(i = 0 ; i < R ; i++){
      for(j = 0 ; j < C ; j++)
        ans += dp[i][j];
    }


    cout << "Case #" << tt <<": "<<ans << endl;
  }
}