#include <fstream>
using namespace std;
ifstream fin("jxfgx.in");
ofstream fout("jxfgx.out");
int Map[200][200];
void Solve()
{
int i,j,k,N,M,K,Type,X1,X2,Y1,Y2;
	fin>>N>>M>>K;
	for(i=1;i<=K;i++)
	{
		fin>>Type>>X1>>Y1>>X2>>Y2;
		int Kd;
		if(Type==1)Kd=1;else Kd=-1;
			for(j=Y1;j<=Y2;j++)
				for(k=X1;k<=X2;k++)
					Map[j][k]+=Kd;
			
		int Sum=0;
		for(j=1;j<=N;j++)
			for(k=1;k<=M;k++)
				if(Map[k][j]>=1)
					Sum++;
		fout<<Sum<<endl;
	}
}

int main()
{
	Solve();
	
	fin.close();
	fout.close();
	return 0;
}