#include <bits/stdc++.h>

using namespace std;

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

  int r, c, n, m;
  cin >> r >> c >> n >> m;

  vector<int> x1(n), x2(n), y1(n), y2(n);
  vector<long long> a(n);
  for (int i = 0; i < n; i++)
    cin >> y1[i] >> y2[i] >> x1[i] >> x2[i] >> a[i];

  vector<vector<long long> > sum(r+2, vector<long long>(c+2));
  for (int i = 0; i < m; i++) {
    int x, y, b, p;
    cin >> y >> x >> b >> p;
    sum[max(y-b,1)][max(x-b,1)] += p;
    sum[max(y-b,1)][min(x+b,c)+1] -= p;
    sum[min(y+b,r)+1][max(x-b,1)] -= p;
    sum[min(y+b,r)+1][min(x+b,c)+1] += p;
  }

  for (int i = 0; i <= r+1; i++) 
    for (int j = 1; j <= c+1; j++)
      sum[i][j] += sum[i][j-1];

  for (int j = 0; j <= c+1; j++)
    for (int i = 1; i <= r+1; i++)
      sum[i][j] += sum[i-1][j];

  for (int i = 1; i <= r; i++)
    for (int j = 1; j <= c; j++)
      sum[i][j] += sum[i][j-1] + sum[i-1][j] - sum[i-1][j-1];
  
  int ret = n;
  for (int i = 0; i < n; i++) {
    long long tmp = sum[y2[i]][x2[i]] - sum[y1[i]-1][x2[i]] - sum[y2[i]][x1[i]-1] + sum[y1[i]-1][x1[i]-1];
    if (tmp >= a[i])
      --ret;
  }
  
  cout << ret << endl;
  
  return 0;
}