/*
ID: zzyzzy12
LANG: C++
TASK: rect1
*/
#include<iostream>
#include<istream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stack>
#include<algorithm>
#include<queue>
#define oo 2000000000
#define ll long long
using namespace std;
struct node
{
int lx,ly,ux,uy,color;
}s[5510],a[50001];
int ans[2510],A,B,N,i,num;
void cut(node h,int m)
{
int i,lx,ly,ux,uy;
node k;
if (h.lx>=h.ux || h.ly>=h.uy) return;
for (i=m+1;i<=N;i++)
if (!(s[i].lx>=h.ux || s[i].ux<=h.lx || s[i].ly>=h.uy || s[i].uy<=h.ly))
break;
if (i>N)
{
a[++num]=h;
return;
}
if (h.lx>=s[i].lx && h.ux<=s[i].ux && h.ly>=s[i].ly && h.uy<=s[i].uy) return;
lx=max(s[i].lx,h.lx); ly=max(s[i].ly,h.ly); ux=min(s[i].ux,h.ux); uy=min(s[i].uy,h.uy);
//-----------------
k=h; k.lx=ux; cut(k,i);
k=h; k.ux=lx; cut(k,i);
k=h; k.ly=uy; k.lx=lx; k.ux=ux; cut(k,i);
k=h; k.uy=ly; k.lx=lx; k.ux=ux; cut(k,i);
//-----------------
return;
}
int main()
{
freopen("rect1.in","r",stdin);
freopen("rect1.out","w",stdout);
memset(ans,0,sizeof(ans));
scanf("%d%d%d",&A,&B,&N);
for (i=1;i<=N;i++) scanf("%d%d%d%d%d",&s[i].lx,&s[i].ly,&s[i].ux,&s[i].uy,&s[i].color);
s[0].lx=s[0].ly=0; s[0].ux=A; s[0].uy=B; s[0].color=1;
num=0;
for (i=N;i>=0;i--)
cut(s[i],i);
for (i=1;i<=num;i++) ans[a[i].color]+=(a[i].ux-a[i].lx)*(a[i].uy-a[i].ly);
for (i=1;i<=2500;i++)
if (ans[i]) printf("%d %d\n",i,ans[i]);
return 0;
}