Problem Statement

The magical girl Madoka was fighting the witch Walpurgisnacht.
Since Walpurgisnacht commands multiple familiars, she cannot be defeated unless all the enemies are damaged within a short time.
Madoka therefore decided to use an attack spell that targets an area in order to defeat the enemies efficiently.

You are given the coordinates and HP of Walpurgisnacht and her familiars, and the areas Madoka attacked along with the damage dealt to enemies.
Find the total remaining HP of the enemies that have not been defeated.

Input

\(N\) \(K\)
\(X_{1}\) \(Y_{1}\) \({HP}_{1}\)
\(X_{2}\) \(Y_{2}\) \({HP}_{2}\)
\(\ldots\)
\(X_{N}\) \(Y_{N}\) \({HP}_{N}\)
\(AX_{1}\) \(AY_{1}\) \(W_{1}\) \(H_{1}\) \(D_{1}\)
\(AX_{2}\) \(AY_{2}\) \(W_{2}\) \(H_{2}\) \(D_{2}\)
\(\ldots\)
\(AX_{K}\) \(AY_{K}\) \(W_{K}\) \(H_{K}\) \(D_{K}\)

All input values are integers.

• \(1 \leq N \leq 100000\) is the number of enemies.
• \(1 \leq K \leq 100000\) is the number of Madoka's attacks.
• \(-500 \leq X_{k}, Y_{k} \leq 500\) are the coordinates of the \(k\)-th enemy.
• \(1 \leq {HP}_{k} \leq 10000\) is the HP of the \(k\)-th enemy.
• \(-500 \leq AX_{t}, AY_{t} \leq 500\)
• \(1 \leq W_{t}, H_{t} \leq 500\)
• \(1 \leq D_{t} \leq 10000\)
• The \(t\)-th attack deals \(D\) damage to every enemy satisfying \(AX_{t} \leq X \leq AX_{t} + W_{t}\) and \(AY_{t} \leq Y \leq AY_{t} + H_{t}\).
• No two enemies exist at the same coordinates.
• The same attack may be performed multiple times.

Output

An enemy is defeated when it has received damage greater than or equal to its HP. Compute and output the total HP of the enemies that have not been defeated.

Sample

7 2
0 0 1
1 0 1
1 1 2
1 2 1
2 0 1
2 1 1
2 2 1
-1 -1 2 2 1
1 0 1 2 1

0

4 1
1 0 1
1 2 1
2 0 2
2 1 1
-1 -1 3 3 2

0

4 1
1 0 2
1 2 1
2 0 1
2 1 1
-1 0 3 3 1

1