#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;
ll S[2010][2010];

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

  int T[N];
  int U[N];
  int L[N];
  int R[N];
  ll A[N];

  for (int i = 0; i < N; ++i) {
    cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i];
  }

  int X[M];
  int Y[M];
  int B[M];
  ll C[M];

  for (int i = 0; i < M; ++i) {
    cin >> X[i] >> Y[i] >> B[i] >> C[i];
  }

  memset(S, 0, sizeof(S));
  for (int i = 0; i < M; ++i) {
    int y = Y[i];
    int x = X[i];
    int b = B[i];
    ll c = C[i];
    int ly = max(1, y - b);
    int lx = max(1, x - b);
    int ry = min(H, y + b);
    int rx = min(W, x + b);

    // fprintf(stderr, "(%d, %d) - (%d, %d)\n", ly, lx, ry, rx);
    S[ly][lx] += c;
    S[ly][rx + 1] -= c;
    S[ry + 1][lx] -= c;
    S[ry + 1][rx + 1] += c;
  }

  for (int i = 0; i < 2; ++i) {
    for (int y = 0; y <= H; ++y) {
      ll sum = 0;
      for (int x = 0; x <= W; ++x) {
        sum += S[y][x];
        S[y][x] = sum;
      }
    }

    for (int x = 0; x <= W; ++x) {
      ll sum = 0;
      for (int y = 0; y <= H; ++y) {
        sum += S[y][x];
        S[y][x] = sum;
      }
    }
  }

  /*
  for (int y = 0; y <= H; ++y) {
    for (int x = 0; x <= W; ++x) {
      cerr << S[y][x] << " ";
    }
    cerr << endl;
  }
  */

  int ans = 0;

  for (int i = 0; i < N; ++i) {
    int ly = T[i];
    int ry = U[i];
    int lx = L[i];
    int rx = R[i];
    // fprintf(stderr, "(%d, %d) - (%d, %d)\n", ly, lx, ry, rx);
    ll damage = S[ry][rx] - S[ry][lx - 1] - S[ly - 1][rx] + S[ly - 1][lx - 1];
    if (damage < A[i]) ++ans;
  }

  cout << ans << endl;

  return 0;
}