#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int H, W, N, M; cin >> H >> W >> N >> M;

    vector<vector<ll>> c(H+1, vector<ll>(W+1, 0));

    vector<int> T(N), U(N), L(N), R(N);
    vector<ll> A(N);

    rep(i, N){
        cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i]; T[i]--, L[i]--;
    }

    rep(i, M){
        int X, Y, B, C; cin >> X >> Y >> B >> C;

        int t = max(X-B, 1), u = min(X+B, H), l = max(Y-B, 1), r = min(Y+B, W);
        
        c[t][l] += C;
        if(r < W) c[t][r+1] -= C;
        if(u < H) c[u+1][l] -= C;
    }

    rep(i, H+1){
        rep2(j, 1, W) c[i][j] += c[i][j-1];
    }
    rep(j, W+1){
        rep2(i, 1, H) c[i][j] += c[i-1][j];
    }

    rep(i, H+1){
        rep2(j, 1, W) c[i][j] += c[i][j-1];
    }
    rep(j, W+1){
        rep2(i, 1, H) c[i][j] += c[i-1][j];
    }

    int ans = 0;

    rep(i, N){
        ans += (c[U[i]][R[i]]-c[T[i]][R[i]]-c[U[i]][L[i]]+c[T[i]][L[i]] >= A[i]? 0 : 1);
    }

    cout << ans << '\n';
}