#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define SZ(X) ((int)X.size())
#define mp make_pair
#define pb push_back
#define RALL(X) X.rbegin(),X.rend()
#define ALL(X) X.begin(),X.end()
using ll = long long ;
using ld = long double ;
const int N = 207;
struct node
{
int x, y;
}p[N];
int x[N<<2], y[N<<2];
int xx[N<<2], yy[N<<2];
bool vis[N<<2][N<<2];
int cox, coy;
const int dirx[] = {-1,0,1,0};
const int diry[] = {0,-1,0,1};
bool inside(int i, int j)
{
return i >= 1 && i <= cox && j >= 1 && j <= coy;
}
ll dfs(int i, int j)
{
ll res = 0;
vis[i][j] = 1;
res += xx[i] * 1LL * yy[j];
for(int k = 0;k < 4;k ++) {
int dx = i + dirx[k];
int dy = j + diry[k];
if(inside(dx, dy) && !vis[dx][dy]) {
res += dfs(dx, dy);
}
}
return res;
}
int main()
{
int T, Case = 0;
cin >> T;
while(T --) {
ll R, C;
cin >> R >> C;
int g;
cin >> g;
for(int i = 1;i <= g;i ++) cin >> p[i].x >> p[i].y;
memset(vis, 0, sizeof(vis));
memset(xx, 0, sizeof(xx));
memset(yy, 0, sizeof(yy));
int nx = 0;
cox = 0;
map<int, int> unx;
x[++nx] = 1; x[++nx] = R;
for(int i = 1;i <= g;i ++) {
x[++nx] = p[i].x;
}
sort(x+1, x+1+nx);
nx = unique(x+1, x+1+nx) - (x+1);
for(int i = 1;i <= nx;i ++) {
if(x[i] - x[i - 1] != 1) {
xx[++cox] = x[i] - x[i - 1] - 1;
}
xx[++cox] = 1; //可以多标记,使其分块,便于统计。
unx[x[i]] = cox;
}
int ny = 0;
coy = 0;
map<int, int> uny;
y[++ny] = 1, y[++ny] = C;
for(int i = 1;i <= g;i ++) {
y[++ny] = p[i].y;
}
sort(y+1, y+1+ny);
ny = unique(y+1, y+1+ny) - (y+1);
for(int i = 1;i <= ny;i ++) {
if(y[i] - y[i - 1] != 1) {
yy[++coy] = y[i] - y[i - 1] - 1;
}
yy[++coy] = 1;//可以多标记,使其分块,便于统计。
uny[y[i]] = coy;
}
for(int i = 1;i <= g;i ++) {
vis[unx[p[i].x]][uny[p[i].y]] = 1; //只把坏点标记。
}
// printf("%d %d\n", cox, coy);
vector<ll>ANS;
for(int i = 1;i <= cox;i ++) {
for(int j = 1;j <= coy;j ++) {
if(!vis[i][j]) {
vis[i][j] = 1;
ANS.pb(dfs(i, j));
}
}
}
sort(ALL(ANS));
printf("Case #%d:\n", ++Case);
printf("%d\n",SZ(ANS));
for(int i = 0;i < SZ(ANS);i ++) {
printf("%lld%c", ANS[i], i == SZ(ANS)-1 ? '\n' : ' ');
}
}
return 0;
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define SZ(X) ((int)X.size())
#define mp make_pair
#define pb push_back
#define RALL(X) X.rbegin(),X.rend()
#define ALL(X) X.begin(),X.end()
using ll = long long ;
using ld = long double ;
const int N = 207;
struct node
{
int x, y;
}p[N];
int x[N<<2], y[N<<2];
int xx[N<<2], yy[N<<2];
bool vis[N<<2][N<<2];
int cox, coy;
const int dirx[] = {-1,0,1,0};
const int diry[] = {0,-1,0,1};
bool inside(int i, int j)
{
return i >= 1 && i <= cox && j >= 1 && j <= coy;
}
ll dfs(int i, int j)
{
ll res = 0;
vis[i][j] = 1;
res += xx[i] * 1LL * yy[j];
for(int k = 0;k < 4;k ++) {
int dx = i + dirx[k];
int dy = j + diry[k];
if(inside(dx, dy) && !vis[dx][dy]) {
res += dfs(dx, dy);
}
}
return res;
}
int main()
{
int T, Case = 0;
cin >> T;
while(T --) {
ll R, C;
cin >> R >> C;
int g;
cin >> g;
for(int i = 1;i <= g;i ++) cin >> p[i].x >> p[i].y;
memset(vis, 0, sizeof(vis));
memset(xx, 0, sizeof(xx));
memset(yy, 0, sizeof(yy));
int nx = 0;
cox = 0;
map<int, int> unx;
x[++nx] = 1; x[++nx] = R;
for(int i = 1;i <= g;i ++) {
x[++nx] = p[i].x;
}
sort(x+1, x+1+nx);
nx = unique(x+1, x+1+nx) - (x+1);
for(int i = 1;i <= nx;i ++) {
if(x[i] - x[i - 1] != 1) {
xx[++cox] = x[i] - x[i - 1] - 1;
}
xx[++cox] = 1; //可以多标记,使其分块,便于统计。
unx[x[i]] = cox;
}
int ny = 0;
coy = 0;
map<int, int> uny;
y[++ny] = 1, y[++ny] = C;
for(int i = 1;i <= g;i ++) {
y[++ny] = p[i].y;
}
sort(y+1, y+1+ny);
ny = unique(y+1, y+1+ny) - (y+1);
for(int i = 1;i <= ny;i ++) {
if(y[i] - y[i - 1] != 1) {
yy[++coy] = y[i] - y[i - 1] - 1;
}
yy[++coy] = 1;//可以多标记,使其分块,便于统计。
uny[y[i]] = coy;
}
for(int i = 1;i <= g;i ++) {
vis[unx[p[i].x]][uny[p[i].y]] = 1; //只把坏点标记。
}
// printf("%d %d\n", cox, coy);
vector<ll>ANS;
for(int i = 1;i <= cox;i ++) {
for(int j = 1;j <= coy;j ++) {
if(!vis[i][j]) {
vis[i][j] = 1;
ANS.pb(dfs(i, j));
}
}
}
sort(ALL(ANS));
printf("Case #%d:\n", ++Case);
printf("%d\n",SZ(ANS));
for(int i = 0;i < SZ(ANS);i ++) {
printf("%lld%c", ANS[i], i == SZ(ANS)-1 ? '\n' : ' ');
}
}
return 0;
}