#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110;

int s[N], t[N], c[N];
int a[N], b[N], p[N], m[N];
int d[N], r[N];
int n, M;
int res = 1e6;

void dfs(int u, int sum) {
    // 剪枝：当前费用已超过已知最优解
    if (sum >= res) return;

    // 检查是否满足所有需求
    bool success = true;
    for (int j = 0; j < N; j++) 
    {
        if (d[j] < r[j]) 
        {
            success = false;
            break;
        }
    }
    if (success) 
    {
        res = min(res, sum);
        return;
    }

    // 所有空调处理完毕
    if (u == M) return;

    // 不选当前空调
    dfs(u + 1, sum);

    // 选当前空调
    for (int j = a[u]; j <= b[u]; j++)
        d[j] += p[u];

    dfs(u + 1, sum + m[u]);

    for (int j = a[u]; j <= b[u]; j++)
        d[j] -= p[u];
}

int main() {
    cin >> n >> M;

    for (int i = 0; i < n; i++) {
        cin >> s[i] >> t[i] >> c[i];
        for (int j = s[i]; j <= t[i]; j++) {
            r[j] += c[i];
        }
    }

    for (int i = 0; i < M; i++) {
        cin >> a[i] >> b[i] >> p[i] >> m[i];
    }

    dfs(0, 0);

    cout << res << endl;

    return 0;
}