#include <bits/stdc++.h>

#define For(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rFor(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second

using namespace std;

typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct coord_comp {
    vector<T> v;
    bool sorted = false;

    coord_comp() {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        sort(v.begin(), v.end());
        v.erase(unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 100010;

int h, w, n, m;
lint grid[2010][2010];
int t[MAX], u[MAX], l[MAX], r[MAX], a[MAX];

int main() {
    scanf("%d%d%d%d", &h, &w, &n, &m);
    rep(i, n) {
        scanf("%d%d%d%d%d", &t[i], &u[i], &l[i], &r[i], &a[i]);
        --t[i];
        --l[i];
    }
    rep(i, m) {
        int x, y, b, c;
        scanf("%d%d%d%d", &x, &y, &b, &c);
        grid[max(0, x - b)][max(0, y - b)] += c;
        grid[max(0, x - b)][min(w, y + b + 1)] -= c;
        grid[min(h, x + b + 1)][max(0, y - b)] -= c;
        grid[min(h, x + b + 1)][min(w, y + b + 1)] += c;
    }
    rep(i, h + 1) rep(j, w + 1) grid[i][j + 1] += grid[i][j];
    rep(j, w + 1) rep(i, h + 1) grid[i + 1][j] += grid[i][j];
    rep(i, h + 1) rep(j, w + 1) grid[i][j + 1] += grid[i][j];
    rep(j, w + 1) rep(i, h + 1) grid[i + 1][j] += grid[i][j];

    int ans = n;
    rep(i, n) {
        int num = grid[u[i]][r[i]] - grid[u[i]][l[i]] - grid[t[i]][r[i]] +
                  grid[t[i]][l[i]];
        ans -= (a[i] <= num);
    }
    printf("%d\n", ans);
}