#include using namespace std; typedef long long ll; typedef pair< int, int > pii; typedef vector< int > vi; typedef vector< vi > vvi; typedef vector< ll > vl; typedef vector< vl > vvl; typedef vector< pii > vp; typedef vector< vp > vvp; typedef vector< string > vs; typedef vector< double > vd; typedef vector< vd > vvd; template< class T1, class T2 > int upmin( T1 &x, T2 v ){ if( x > v ){ x = v; return 1; } return 0; } template< class T1, class T2 > int upmax( T1 &x, T2 v ){ if( x < v ){ x = v; return 1; } return 0; } const int INF = 0x3f3f3f3f; int N, K; vi X, Y, HP; vi AX, AY, W, H, D; void init(){ cin >> N >> K; X = Y = HP = vi( N ); for( int i = 0; i < N; ++i ) cin >> X[ i ] >> Y[ i ] >> HP[ i ]; AX = AY = W = H = D = vi( K ); for( int i = 0; i < K; ++i ) cin >> AX[ i ] >> AY[ i ] >> W[ i ] >> H[ i ] >> D[ i ]; } vvi imo; void preprocess(){ imo = vvi( 500 + 501 + 1, vi( 500 + 501 + 1 ) ); for( int i = 0; i < N; ++i ) imo[ X[ i ] + 501 ][ Y[ i ] + 501 ] += HP[ i ], imo[ X[ i ] + 501 + 1 ][ Y[ i ] + 501 ] -= HP[ i ], imo[ X[ i ] + 501 ][ Y[ i ] + 501 + 1 ] -= HP[ i ], imo[ X[ i ] + 501 + 1 ][ Y[ i ] + 501 + 1 ] += HP[ i ]; for( int i = 0; i < K; ++i ) imo[ X[ i ] + 501 ][ Y[ i ] + 501 ] -= D[ i ], imo[ X[ i ] + 501 + W[ i ] + 1 ][ Y[ i ] + 501 ] += D[ i ], imo[ X[ i ] + 501 ][ Y[ i ] + 501 + H[ i ] + 1 ] += D[ i ], imo[ X[ i ] + 501 + W[ i ] + 1 ][ Y[ i ] + 501 + H[ i ] + 1 ] -= D[ i ]; for( int i = -500 + 501; i <= 500 + 501; ++i ) for( int j = -500 + 501; j + 1 <= 500 + 501; ++j ) imo[ i ][ j + 1 ] += imo[ i ][ j ]; for( int i = -500 + 501; i <= 500 + 501; ++i ) for( int j = -500 + 501; j + 1 <= 500 + 501; ++j ) imo[ j + 1 ][ i ] += imo[ j ][ i ]; } void solve(){ int ans = 0; for( int i = -500 + 501; i <= 500 + 501; ++i ) for( int j = -500 + 501; j <= 500 + 501; ++j ) ans += ( imo[ i ][ j ] > 0 ) * imo[ i ][ j ]; cout << ans << endl; } signed main(){ ios::sync_with_stdio( 0 ); init(); preprocess(); solve(); return 0; }