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

ll s[2001][2001];

struct P {
    int t, u, l, r, a;
};

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

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

    vector<P> p(n);
    for (int i = 0; i < n; i++) {
        int t, u, l, r, a;
        cin >> t >> u >> l >> r >> a;
        t--; l--;
        t--; u--; l--; r--;

        p[i] = { t, u, l, r, a };
    }

    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 l = 0; l < 2; l++) {
        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 = 0; i <= h; i++) {
        //    for (int j = 0; j <= w; j++) {
        //        cout << s[i][j] << ' ';
        //    }
        //    cout << '\n';
        //}
        //cout << '\n';
    }

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

    cout << ans << endl;

    return 0;
}