#include <bits/stdc++.h> 
using namespace std; 
using int128  = __int128_t; 
using int64   = long long; 
using int32   = int; 
using uint128 = __uint128_t; 
using uint64  = unsigned long long; 
using uint32  = unsigned int; 

#define ALL(obj) (obj).begin(),(obj).end() 
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>; 

constexpr int64 MOD = 1'000'000'000LL + 7; //' 
constexpr int64 MOD2 = 998244353; 
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL; 
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //' 
constexpr long double PI = 3.1415926535897932384626433L; 

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} 
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} 
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} 
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} 
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} 
void print(void) {cout << endl;} 
template <class Head> void print(Head&& head) {cout << head;print();} 
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} 
template <class T> void chmax(T& a, const T b){a=max(a,b);} 
template <class T> void chmin(T& a, const T b){a=min(a,b);} 
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;} 
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;} 
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b) 
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} 
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} 
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} 

/** 
 * @url  
 * @est 
 */  
int main() { 
    cin.tie(0);ios::sync_with_stdio(false);
    int64 H,W; cin >> H >> W;
    auto grid = multivector(H+2,W+2,0LL);
    int64 N,M; cin >> N >> M;
    vector<int64> T(N),U(N),L(N),R(N),A(N),Y(M),X(M),B(M),C(M);
    for(int i=0;i<N;++i) cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i];
    for(int i=0;i<M;++i) {
        cin >> Y[i] >> X[i] >> B[i] >> C[i];
        int u = max(1LL,Y[i]-B[i]);
        int d = min(H,Y[i]+B[i]);
        int l = max(1LL,X[i]-B[i]);
        int r = min(W,X[i]+B[i]);
        grid[u][l]+=C[i];
        grid[d+1][l]-=C[i];
        grid[u][r+1]-=C[i];
        grid[d+1][r+1]+=C[i];
    }
    for(int i=0;i<=H;++i) {
        for(int j=1;j<=W;++j) grid[i][j]+=grid[i][j-1];
    }
    for(int j=0;j<=W;++j) {
        for(int i=1;i<=H;++i) grid[i][j]+=grid[i-1][j];
    }
    for(int i=0;i<=H;++i) {
        for(int j=1;j<=W;++j) grid[i][j]+=grid[i][j-1];
    }
    for(int j=0;j<=W;++j) {
        for(int i=1;i<=H;++i) grid[i][j]+=grid[i-1][j];
    }
    int ans = 0;
    for(int i=0;i<N;++i) {
        int l = L[i];
        int r = R[i];
        int u = T[i];
        int d = U[i];
        int64 cnt = grid[d][r]-grid[u-1][r]-grid[d][l-1]+grid[u-1][l-1];
        ans += (cnt < A[i]);
    }
    cout << ans << endl;
    return 0; 
}