f=lambda:map(int,raw_input().split());R=xrange;A=500;U=A*2+1
F=[[0]*(U+1)for i in R(U+1)];N,K=f();E=[f()for i in R(N)]
for i in R(K):x,y,w,h,d=f();x+=A;y+=A;r=min(U,x+w+1);t=min(U,y+h+1);F[y][x]+=d;F[y][r]-=d;F[t][x]-=d;F[t][r]+=d
for h in R(U+1):
	for w in R(U):F[h][w+1]+=F[h][w]
for w in R(U+1):
	for h in R(U):F[h+1][w]+=F[h][w]
print sum(max(0,h-F[y+A][x+A])for x,y,h in E)