/*
TASK:SIENAV
LANG:C++
*/

#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
	FILE *fin = fopen("SIENA.IN", "r");
	int w, h;
	fscanf(fin, "%d%d", &w, &h);
	int n;
	fscanf(fin, "%d", &n);
	int area = w*h;
	for (int i = 0; i < n; ++i) {
		int minx, maxx, miny, maxy, m;
		fscanf(fin, "%d%d%d", &m, &minx, &miny);
		maxx = minx; maxy = miny;
		for (int j = 1; j < m; ++j) {
			int x, y;
			fscanf(fin, "%d%d", &x, &y);
			minx = min(minx, x);
			maxx = max(maxx, x);
			miny = min(miny, y);
			maxy = max(maxy, y);
		}
		area -= (maxx-minx) * (maxy-miny);
	}
	fclose(fin);
	FILE *fout = fopen("SIENA.OUT", "w");
	fprintf(fout, "%d\n", area);
	fclose(fout);
	return 0;
}