#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int H, W, N, M; cin>>H>>W>>N>>M;
    vector<int> T(N), U(N), L(N), R(N);
    vector<ll> A(N);
    for (int i=0;i<N;i++) cin>>T[i]>>U[i]>>L[i]>>R[i]>>A[i];

    vector<vector<ll>> field(H+1, vector<ll>(W+1, 0));
    for (int i=0;i<M;i++){
        int X, Y, B; ll C;
        cin>>X>>Y>>B>>C;
        int Xmin=max(X-B, 1), Xmax=min(X+B, H)+1;
        int Ymin=max(Y-B, 1), Ymax=min(Y+B, W)+1;
        field[Xmin][Ymin] += C;
        if (Xmax<=H) field[Xmax][Ymin] -= C;
        if (Ymax<=W) field[Xmin][Ymax] -= C;
        if (Xmax<=H && Ymax<=W) field[Xmax][Ymax] += C;
    }

    for (int i=1;i<=H;i++){
        for (int j=1;j<=W;j++) field[i][j] += field[i-1][j];
    }
    for (int i=1;i<=H;i++){
        for (int j=1;j<=W;j++) field[i][j] += field[i][j-1];
    }

    vector<vector<ll>> sum = field;
    for (int i=1;i<=H;i++){
        for (int j=1;j<=W;j++) sum[i][j] += sum[i-1][j];
    }
    for (int i=1;i<=H;i++){
        for (int j=1;j<=W;j++) sum[i][j] += sum[i][j-1];
    }
    int ans = 0;
    for (int i=0;i<N;i++){
        ll damage = sum[U[i]][R[i]]-sum[U[i]][L[i]-1]-sum[T[i]-1][R[i]]+sum[T[i]-1][L[i]-1];
        if(damage<A[i]) ans++;
    }
    cout << ans << "\n";
}