#include <iostream>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int h, w, n, m;
int t[100000], u[100000], l[100000], r[100000], a[100000];
int x[100000], y[100000], b[100000], c[100000];
int damage[2001][2001];

int get(int x, int y) {
	if (x < 0 || y < 0) return 0;
	return damage[x][y];
}

signed main() {
	int i, j;
	
	cin >> h >> w >> n >> m;
	rep(i, n) cin >> t[i] >> u[i] >> l[i] >> r[i] >> a[i];
	rep(i, m) cin >> x[i] >> y[i] >> b[i] >> c[i];
	rep(i, n) { t[i]--; u[i]--; l[i]--; r[i]--; }
	rep(i, m) { x[i]--; y[i]--; }
	
	rep(i, m) {
		int lx = max(x[i] - b[i], 0LL);
		int ly = max(y[i] - b[i], 0LL);
		int rx = min(x[i] + b[i] + 1, h);
		int ry = min(y[i] + b[i] + 1, w);
		damage[lx][ly] += c[i];
		damage[rx][ry] += c[i];
		damage[lx][ry] -= c[i];
		damage[rx][ly] -= c[i];
	}
	rep(i, h) rep(j, w) damage[i][j + 1] += damage[i][j];
	rep(j, w) rep(i, h) damage[i + 1][j] += damage[i][j];
	rep(i, h) rep(j, w) damage[i][j + 1] += damage[i][j];
	rep(j, w) rep(i, h) damage[i + 1][j] += damage[i][j];
	
	int ans = 0;
	rep(i, n) {
		int d = get(t[i] - 1, l[i] - 1) + get(u[i], r[i]) - get(t[i] - 1, r[i]) - get(u[i], l[i] - 1);
		if (d < a[i]) ans++;
	}
	
	cout << ans << endl;
	return 0;
}