#include<set>
#include<map>
#include<cstdio>
#include<utility>
#include<cmath>
#include<stack>
#include<vector>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<algorithm>
#define ll long long
#define ull unsigned long long
using namespace std;
const int maxn = 100+10;
const int seed = 131;
const int MOD = 100013;
const int INF = 0x3f3f3f3f;
struct node{int x1,y1,x2,y2,color;
}q[maxn];
int x[maxn << 1],y[maxn << 1];    //离散
int mp[maxn << 1][maxn << 1];
int color[maxn];
int main(){int h,w;int n,Case = 1;while(~scanf("%d%d",&h,&w) && h + w){scanf("%d",&n);int num1 = 0,num2 = 0;for(int i = 1;i <= n;i++){scanf("%d%d%d%d%d",&q[i].x1,&q[i].y1,&q[i].x2,&q[i].y2,&q[i].color);x[num1++] = q[i].x1,x[num1++] = q[i].x2;y[num2++] = q[i].y1,y[num2++] = q[i].y2;}sort(x,x + num1);sort(y,y + num2);num1 = unique(x,x + num1) - x;num2 = unique(y,y + num2) - y;memset(mp,0,sizeof(mp));memset(color,0,sizeof(color));for(int k = 1;k <= n;k++){int x1 = lower_bound(x,x + num1,q[k].x1) - x;int x2 = lower_bound(x,x + num1,q[k].x2) - x;int y1 = lower_bound(y,y + num2,q[k].y1) - y;int y2 = lower_bound(y,y + num2,q[k].y2) - y;for(int i = x1 + 1;i <= x2;i++){for(int j = y1 + 1;j <= y2;j++){mp[i][j] = q[k].color;}}}for(int i = 1;i < num1;i++){for(int j = 1;j <= num2;j++){if(mp[i][j]){color[mp[i][j]] += (x[i] - x[i - 1])*(y[j] - y[j - 1]);}}}if(Case != 1) printf("\n");printf("Case %d:\n",Case++);int num = 0;for(int i = 1;i <= 100;i++){if(color[i]){printf("%d %d\n",i,color[i]);num++;}}if(num == 1){printf("There is 1 color left on the wall.\n");}else{printf("There are %d colors left on the wall.\n",num);}}return 0;
}