#include<bits/stdc++.h>
using namespace std;
int n, m, a[1010], b[1010], c[1010], st[1010], to[1010], p[1010], w[1010], cs[1010], ans;
void dfs(int x, int num, int s) {
	if(s >= ans) {
		return ;
	}
	if(x == m + 1) {
		int d[1010] = {0};
		for(int i = 1; i <= num; i ++) {
			for(int j = st[cs[i]]; j <= to[cs[i]]; j ++) {
				d[j] += w[cs[i]];
			}
		}
		for(int i = 1; i <= n; i ++) {
			for(int j = a[i]; j <= b[i]; j ++) {
				if(d[j] < c[i]) {
					return ;
				}
			}
		}
		ans = s;
	}
	dfs(x + 1, num, s);
	cs[num + 1] = x;
	dfs(x + 1, num + 1, s + p[x]);
	cs[num + 1] = 0;
	
}
int main() {
	freopen("kongtiao.in", "r", stdin);
	freopen("kongtiao.out", "w", stdout);
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i] >> b[i] >> c[i];
	}
	for(int i = 1; i <= m; i ++) {
		cin >> st[i] >> to[i] >> w[i] >> p[i];
	}
	ans = 1e7;
	dfs(1, 0, 0);
	cout << ans;
	return 0;
}