#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<chrono>
#include<random>
#include<cctype>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(decltype(n) i=0; i<(n); i++)
#define rrep(i,n) for(decltype(n) i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(decltype(a) i=(a); i<(b); i++)
#define RFOR(i,a,b) for(decltype(b) i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll h,w,n,m; in(h,w,n,m);
    vector<ll> t(n),u(n),r(n),l(n),a(n),x(m),y(m),b(m),c(m);
    rep(i,n) in(t[i], u[i], l[i], r[i], a[i]);
    rep(i,n){
        t[i]--; l[i]--;
    }
    rep(i,m) in(x[i], y[i], b[i], c[i]);
    rep(i,m){
        x[i]--; y[i]--;
    }
    ll s[h+1][w+1];
    rep(i,h+1)rep(j,w+1) s[i][j] = 0;
    rep(i,m){
        int h1 = max(0LL, x[i]-b[i])+1, h2 = min(h, x[i]+b[i]+1)+1;
        int w1 = max(0LL, y[i]-b[i])+1, w2 = min(w, y[i]+b[i]+1)+1;
        s[h1][w1] += c[i];
        if(h2 <= h && w2 <= w) s[h2][w2] += c[i];
        if(w2 <= w) s[h1][w2] -= c[i];
        if(h2 <= h) s[h2][w1] -= c[i];
    }
    rep(i,h+1){
        rep(j,w) s[i][j+1] += s[i][j];
    }
    rep(j,w+1){
        rep(i,h) s[i+1][j] += s[i][j];
    }
    rep(i,h+1){
        rep(j,w) s[i][j+1] += s[i][j];
    }
    rep(j,w+1){
        rep(i,h) s[i+1][j] += s[i][j];
    }
    int ans = 0;
    rep(i,n){
        int h1 = t[i], h2 = u[i], w1 = l[i], w2 = r[i];
        ll dmg = s[h2][w2] - s[h1][w2] - s[h2][w1] + s[h1][w1];
        if(dmg < a[i]) ans++;
    }
    out(ans);
}