#include <stdio.h>

int main()
{
	int i, j, t, u, l, r, H, W, N, M, T[100001], U[100001], L[100001], R[100001], A[100001], X, Y, B, C;
	long long bomb[2002][2002] = {}, tmp;
	scanf("%d %d %d %d", &H, &W, &N, &M);
	for (i = 1; i <= N; i++) scanf("%d %d %d %d %d", &(T[i]), &(U[i]), &(L[i]), &(R[i]), &(A[i]));
	for (i = 1; i <= M; i++) {
		scanf("%d %d %d %d", &X, &Y, &B, &C);
		t = X - B;
		if (t <= 0) t = 1;
		u = X + B;
		if (u > H) u = H;
		l = Y - B;
		if (l <= 0) l = 1;
		r = Y + B;
		if (r > W) r = W;
		bomb[t][l] += C;
		bomb[u+1][l] -= C;
		bomb[t][r+1] -= C;
		bomb[u+1][r+1] += C;
	}
	for (i = 1; i <= H; i++) {
		for (j = 1, tmp = 0; j <= W; j++) {
			tmp += bomb[i][j];
			bomb[i][j] = tmp;
		}
	}
	for (j = 1; j <= W; j++) {
		for (i = 1, tmp = 0; i <= H; i++) {
			tmp += bomb[i][j];
			bomb[i][j] = tmp;
		}
	}
	for (i = 1; i <= H; i++) for (j = 1; j <= W; j++) bomb[i][j] += bomb[i-1][j] + bomb[i][j-1] - bomb[i-1][j-1];
	
	int ans = 0;
	for (i = 1; i <= N; i++) {
		tmp = bomb[U[i]][R[i]] - bomb[U[i]][L[i]-1] - bomb[T[i]-1][R[i]] + bomb[T[i]-1][L[i]-1];
		if (tmp < A[i]) ans++;
	}
	printf("%d\n", ans);
	fflush(stdout);
	return 0;
}