#include <bits/stdc++.h>
using ll = long long;
using namespace std;

ll s[2001][2001];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int h, w, n, m;
    cin >> h >> w >> n >> m;

    vector<array<int, 5>> p(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 5; j++) {
            cin >> p[i][j];
        }
    }

    for (int i = 0; i < m; i++) {
        int x, y, b, c;
        cin >> x >> y >> b >> c;
        int t = max(x - b - 1, 0);
        int u = min(x + b, h);
        int l = max(y - b - 1, 0);
        int r = min(y + b, w);

        s[t][l] += c;
        s[t][r] -= c;
        s[u][l] -= c;
        s[u][r] += c;
    }
    for (int _ = 0; _ < 2; _++) {
        for (int i = 1; i < h; i++) {
            for (int j = 0; j < w; j++) {
                s[i][j] += s[i - 1][j];
            }
        }
        for (int i = 0; i < h; i++) {
            for (int j = 1; j < w; j++) {
                s[i][j] += s[i][j - 1];
            }
        }
    }

    for (int i = h; --i >= 0;) {
        for (int j = w; --j >= 0;) {
            s[i + 1][j + 1] = s[i][j];
        }
    }
    for (int i = 0; i <= h; i++) {
        s[i][0] = 0;
    }
    for (int j = 0; j <= w; j++) {
        s[0][j] = 0;
    }

    int ans = 0;
    for (auto [t, u, l, r, a] : p) {
        t--; l--;
        ll c = s[u][r] - s[u][l] - s[t][r] + s[t][l];
        ans += c < a;
    }

    cout << ans << endl;

    return 0;
}