#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int H, W, N, M;
	cin >> H >> W >> N >> M;
	
	vector<int> T(N), U(N), L(N), R(N), A(N);
	rep(i, 0, N) cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i];
	
	vector sum(H + 5, vector<ll>(W + 5, 0));
	rep(i, 0, M) {
		int X, Y, B, C;
		cin >> X >> Y >> B >> C;
		--X, --Y;
		
		sum[max(0, X - B)][max(0, Y - B)] += C;
		sum[min(H + 4, X + B + 1)][max(0, Y - B)] -= C;
		sum[max(0, X - B)][min(W + 4, Y + B + 1)] -= C;
		sum[min(H + 4, X + B + 1)][min(W + 4, Y + B + 1)] += C;
	}
	
	rep(i, 1, H + 5) rep(j, 0, W + 5) sum[i][j] += sum[i - 1][j];
	rep(i, 0, H + 5) rep(j, 1, W + 5) sum[i][j] += sum[i][j - 1];
	
	rep(i, 1, H + 5) rep(j, 0, W + 5) sum[i][j] += sum[i - 1][j];
	rep(i, 0, H + 5) rep(j, 1, W + 5) sum[i][j] += sum[i][j - 1];
	
	int ans = 0;
	rep(i, 0, N) {
		ll S = 0;
		--T[i], --U[i], --L[i], --R[i];
		
		S += sum[U[i]][R[i]];
		if (T[i] != 0) S -= sum[T[i] - 1][R[i]];
		if (L[i] != 0) S -= sum[U[i]][L[i] - 1];
		if (T[i] != 0 && L[i] != 0) S += sum[T[i] - 1][L[i] - 1];
		
		if (S < A[i]) ++ans;
	}
	cout << ans << '\n';
}