#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}


void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll H,W,N,M;
	cin>>H>>W>>N>>M;
	vector<vector<ll>> table(H+2,vector<ll>(W+2));
	vector<ll> T(N),U(N),L(N),R(N),A(N);
	rep(i,N) cin>>T[i]>>U[i]>>L[i]>>R[i]>>A[i];
	vector<ll> X(M),Y(M),B(M),C(M);
	rep(i,M) cin>>X[i]>>Y[i]>>B[i]>>C[i];
	rep(i,M){
		int a=max(0ll,X[i]-B[i]),b=min(H,X[i]+B[i])+1;
		int c=max(0ll,Y[i]-B[i]),d=min(W,Y[i]+B[i])+1;
		table[a][c]+=C[i];
		table[a][d]-=C[i];
		table[b][c]-=C[i];
		table[b][d]+=C[i];
	}
	rep(i,H+2) rep(j,W+1) table[i][j+1]+=table[i][j];
	rep(i,H+1) rep(j,W+2) table[i+1][j]+=table[i][j];
	rep(i,H+2) rep(j,W+1) table[i][j+1]+=table[i][j];
	rep(i,H+1) rep(j,W+2) table[i+1][j]+=table[i][j];
	int ans=0;
	rep(i,N){
		ll v=0;
		v+=table[T[i]-1][L[i]-1];
		v-=table[T[i]-1][R[i]];
		v-=table[U[i]][L[i]-1];
		v+=table[U[i]][R[i]];
		if(v<A[i]) ans++;
	}
	cout<<ans<<"\n";
}