#include using namespace std; typedef long long ll; typedef vector VI; typedef vector VVI; typedef vector VL; typedef vector> VVL; typedef pair Pair; typedef tuple tpl; #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define REVERSE(c) reverse((c).begin(),(c).end()) #define EXIST(m,v) (m).find((v)) != (m).end() #define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin() #define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin() #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i) #define RREP(i,n) RFOR(i,n,0) #define en "\n" constexpr double EPS = 1e-9; constexpr double PI = 3.1415926535897932; constexpr int INF = 2147483647; constexpr long long LINF = 1LL<<60; constexpr long long MOD = 1000000007; // 998244353; template inline bool chmax(T& a, T b){if(a inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} void Main(){ int H,W,N,M; cin >> H >> W >> N >> M; VI T(N),U(N),L(N),R(N),A(N); REP(i,N) cin >> T[i] >> U[i] >> L[i] >> R[i] >> A[i], T[i]--, U[i]--, L[i]--, R[i]--; ll sum[H+2][W+2]; REP(i,H+2)REP(j,W+2) sum[i][j] = 0; REP(i,M){ int x,y,b,c; cin >> x >> y >> b >> c; x--; y--; int s = max(0,x-b), t = max(0,y-b); sum[s+1][t+1] += c; s = min(H,x+b+1); t = min(W,y+b+1); sum[s+1][t+1] += c; s = max(0,x-b); t = min(W,y+b+1); sum[s+1][t+1] -= c; s = min(H,x+b+1); t = max(0,y-b); sum[s+1][t+1] -= c; } REP(i,H+1)REP(j,W+1) sum[i][j+1] += sum[i][j]; REP(j,W+1)REP(i,H+1) sum[i+1][j] += sum[i][j]; FOR(i,1,H+2)FOR(j,1,W+2){ sum[i][j] += sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1]; } int ans = 0; REP(i,N){ ll h = sum[U[i]+1][R[i]+1] - sum[U[i]+1][L[i]] - sum[T[i]][R[i]+1] + sum[T[i]][L[i]]; if(h < A[i]) ans++; } cout << ans << en; return; } int main(void){ cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<>t; while(t--) Main(); return 0; }