#include #define REP(i, x, n) for(int i = x; i < (int)(n); i++) #define rep(i, n) REP(i, 0, n) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define F first #define S second #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair P; int main() { // ios_base::sync_with_stdio(false); int N, K; cin >> N >> K; vector X(N), Y(N), HP(N); rep(i, N) { cin >> X[i] >> Y[i] >> HP[i]; X[i] += 500; Y[i] += 500; } vector> dp(1010, vector(1010, 0)); rep(i, K) { int AX, AY, W, H, D; cin >> AX >> AY >> W >> H >> D; AX += 500; AY += 500; int tx = min(1000, AX + W) + 1; int ty = min(1000, AY + H) + 1; dp[AY][AX] += D; dp[AY][tx] -= D; dp[ty][AX] -= D; dp[ty][tx] += D; } rep(i, 1005) rep(j, 1005) dp[i][j + 1] += dp[i][j]; rep(j, 1005) rep(i, 1005) dp[i + 1][j] += dp[i][j]; ll ans = 0; rep(i, N) ans += max(0LL, HP[i] - dp[Y[i]][X[i]]); cout << ans << endl; return 0; }