#region ZIPPER
using System;
using System.Collections.Generic;
using System.Collections;
using System.Linq;
using System.Text;
using System.Numerics;
using sc = Scanner;
class Program
{
    static void Main(string[] args)
    {
        Solver solver = new Solver();
        solver.Solve();
#if DEBUG
        System.Console.WriteLine("続行するには何かキーを押してください．．．");
        System.Console.ReadKey();
#endif

    }
}
/// <summary>
/// Java風のスキャナー，自作（某最速の人を参考） 自分の実装のせいか，バグってるっぽい バグが出たらO(n^3) n=100000 でTLE
/// </summary>
public static class Scanner
{
    public static string NextString()
    {
        string tmp = "";
        while (true)
        {
            int readData;
            string data;
            readData = Console.Read();
            if (readData == -1) //EOF
            {
                break;
            }
            data = char.ConvertFromUtf32(readData);
            if (data == " " || data == "\n")
            {
                break;
            }
            tmp += data;
        }
        return tmp;
    }
    public static int NextInt()
    {
        string tmp = "";
        while (true)
        {
            int readData;
            string data;
            readData = Console.Read();
            if (readData == -1) //EOF
            {
                break;
            }
            data = char.ConvertFromUtf32(readData);
            if (data == " " || data == "\n")
            {
                break;
            }
            tmp += data;
        }
        return int.Parse(tmp);
    }
    public static long NextLong()
    {
        string tmp = "";
        while (true)
        {
            int readData;
            string data;
            readData = Console.Read();
            if (readData == -1) //EOF
            {
                break;
            }
            data = char.ConvertFromUtf32(readData);
            if (data == " " || data == "\n")
            {
                break;
            }
            tmp += data;
        }
        return long.Parse(tmp);
    }
    public static double NextDouble()
    {
        string tmp = "";
        while (true)
        {
            int readData;
            string data;
            readData = Console.Read();
            if (readData == -1) //EOF
            {
                break;
            }
            data = char.ConvertFromUtf32(readData);
            if (data == " " || data == "\n")
            {
                break;
            }
            tmp += data;
        }
        return double.Parse(tmp);
    }

    public static string[] NextStrArray()
    {
        return Console.ReadLine().Split(' ');
    }
    public static int[] NextIntArray()
    {

        string[] s = NextStrArray();
        int[] a = new int[s.Length];
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = int.Parse(s[i]);
        }
        return a;
    }
    public static long[] NextLongArray()
    {
        string[] s = NextStrArray();
        long[] a = new long[s.Length];
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = long.Parse(s[i]);
        }
        return a;
    }
    public static double[] NextDoubleArray()
    {
        string[] s = NextStrArray();
        double[] a = new double[s.Length];
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = double.Parse(s[i]);
        }
        return a;
    }
}
#endregion ZIPPER

public class Solver
{
#region IGNORE_ME
    public Solver()
    {
        //こんすとらくたん　きにしなくてよろしい
    }
#endregion IGNORE_ME

#region FIELD

#endregion FIELD

    public void Solve()
    {

        int n = sc.NextInt();
        int k = sc.NextInt();
        long[][] enemys = new long[n][];
        long[,] map = new long[1502, 1502]; // 500 ga center [1001] bunki wo rakuni
        long[,] imositaMap = new long[1502, 1502];
        for (int i = 0; i < n; i++)
        {
            enemys[i] = sc.NextLongArray();// 0x 1y 2hp
            enemys[i][0] += 500;//centering
            enemys[i][1] += 500;
        }
        for (int i = 0; i < k; i++)
        {
            int[] data = sc.NextIntArray();
            data[0] += 500;
            data[1] += 500;
            map[data[0], data[1]] += data[4];
            map[data[0] + data[2] + 1, data[1]] -= data[4];
            map[data[0], data[1] + data[3] + 1] -= data[4];
            map[data[0] + data[2] + 1, data[1] + data[3] + 1] += data[4];
        }

        for (int i = 0; i < 1502; i++)
        {
            long tmp = 0;
            for (int j = 0; j < 1502; j++)
            {
                tmp += map[i, j];
                imositaMap[i, j] += tmp;
            }
        }
        for (int i = 0; i < 1502; i++)
        {
            long tmp = 0;
            for (int j = 0; j < 1502; j++)
            {
                tmp += imositaMap[j, i];
                imositaMap[j, i] = tmp;
            }
        }

        for (int i = 0; i < enemys.Length; i++)
        {
            long x = enemys[i][0];
            long y = enemys[i][1];

            enemys[i][2] = Math.Max(0, enemys[i][2] - imositaMap[x, y]);
        }

        long answer = 0;
        for (int i = 0; i < enemys.Length; i++)
        {
            answer += enemys[i][2];
        }
        Console.WriteLine(answer);

#if DEBUG
        Console.WriteLine("");//local check
#endif
    }
}