Problem: Nanami likes playing games, and is also really good at it. This day she was playing a new game which involved operating a power plant. Nanami's job is to control the generators in the plant and produce maximum output.

There are n generators in the plant. Each generator should be set to a generating level. Generating level is an integer (possibly zero or negative), the generating level of the i-th generator should be between li and ri (both inclusive). The output of a generator can be calculated using a certain quadratic function f(x), where x is the generating level of the generator. Each generator has its own function, the function of the i-th generator is denoted as fi(x).

However, there are m further restrictions to the generators. Let the generating level of the i-th generator be xi. Each restriction is of the form xu ≤ xv + d, where u and v are IDs of two different generators and d is an integer.

Nanami found the game tedious but giving up is against her creed. So she decided to have a program written to calculate the answer for her (the maximum total output of generators). Somehow, this became your job.

Input

The first line contains two integers n and m (1 ≤ n ≤ 50; 0 ≤ m ≤ 100) — the number of generators and the number of restrictions.

Then follow n lines, each line contains three integers ai, bi, and ci (|ai| ≤ 10; |bi|, |ci| ≤ 1000) — the coefficients of the function fi(x). That is, fi(x) = aix2 + bix + ci.

Then follow another n lines, each line contains two integers li and ri ( - 100 ≤ li ≤ ri ≤ 100).

Then follow m lines, each line contains three integers ui, vi, and di (1 ≤ ui, vi ≤ n; ui ≠ vi; |di| ≤ 200), describing a restriction. The i-th restriction is xui ≤ xvi + di.

Output

Print a single line containing a single integer — the maximum output of all the generators. It is guaranteed that there exists at least one valid configuration.

Examples

Input

3 3
0 1 0
0 1 1
0 1 2
0 3
1 2
-100 100
1 2 0
2 3 0
3 1 0


Output

9


Input

5 8
1 -8 20
2 -4 0
-1 10 -10
0 1 0
0 -1 1
1 9
1 4
0 10
3 11
7 9
2 1 3
1 2 3
2 3 3
3 2 3
3 4 3
4 3 3
4 5 3
5 4 3


Output

46

Note

In the first sample, f1(x) = x, f2(x) = x + 1, and f3(x) = x + 2, so we are to maximize the sum of the generating levels. The restrictions are x1 ≤ x2, x2 ≤ x3, and x3 ≤ x1, which gives us x1 = x2 = x3. The optimal configuration is x1 = x2 = x3 = 2, which produces an output of 9.

In the second sample, restrictions are equal to |xi - xi + 1| ≤ 3 for 1 ≤ i < n. One of the optimal configurations is x1 = 1, x2 = 4, x3 = 5, x4 = 8 and x5 = 7.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
int a[51], b[51], c[51], l[51], r[51];
int st[51], ed[51];
struct Dinic {
  int V, E, src, tar;
  int head[10100], work[10100], dis[10100];
  int to[60600], cap[60600], nxt[60600];
  int q[10100], qf, qb;
  inline void calc(int n, int m) {
    for (int i = 1; i <= n; i++) {
      add(src, st[i], 0x3f3f3f3f);
      for (int j = st[i]; j < ed[i]; j++) {
        int x = j - st[i] + l[i];
        add(j, j + 1, 1999728 - a[i] * x * x - b[i] * x - c[i]);
      }
      add(ed[i], tar, 0x3f3f3f3f);
    }
    while (m--) {
      int u, v, d;
      scanf("%d %d %d", &u, &v, &d);
      for (int i = l[u], j = i - d; i <= r[u] + 1; i++, j++)
        if (l[v] <= j && j <= r[v] + 1) {
          add(i - l[u] + st[u], j - l[v] + st[v], 0x3f3f3f3f);
        }
    }
    int ans = n * 1999728 - dinic();
    printf("%d", ans);
  }
  inline void init(int n, int s, int t) {
    V = n + 1;
    E = 0;
    src = s;
    tar = t;
    for (int i = 0; i <= V; i++) head[i] = -1;
  }
  inline void add(int u, int v, int c) {
    to[E] = v;
    cap[E] = c;
    nxt[E] = head[u];
    head[u] = E++;
    to[E] = u;
    cap[E] = 0;
    nxt[E] = head[v];
    head[v] = E++;
  }
  inline bool bfs() {
    for (int i = 0; i <= V; i++) dis[i] = -1;
    qf = qb = 0;
    q[qb++] = src;
    dis[src] = 0;
    while (qf < qb && dis[tar] == -1) {
      int u = q[qf++];
      for (int i = head[u]; i >= 0; i = nxt[i]) {
        int v = to[i];
        if (dis[v] == -1 && cap[i] > 0) {
          dis[v] = dis[u] + 1;
          q[qb++] = v;
        }
      }
    }
    return dis[tar] >= 0;
  }
  inline int dfs(int u, int &bot) {
    int v, bot1, delta;
    if (u == tar) return bot;
    for (int &i = work[u]; i >= 0; i = nxt[i]) {
      int v = to[i];
      if (dis[v] != dis[u] + 1 || cap[i] == 0) continue;
      bot1 = min(bot, cap[i]);
      if (delta = dfs(v, bot1)) {
        cap[i] -= delta;
        cap[i ^ 1] += delta;
        bot = bot1;
        return delta;
      }
    }
    return 0;
  }
  inline int dinic() {
    int ans = 0, delta, bot;
    while (bfs()) {
      memcpy(work, head, sizeof(int) * V);
      delta = 0x3f3f3f3f;
      while (delta = dfs(src, bot = 0x3f3f3f3f)) ans += delta;
    }
    return ans;
  }
} dinic;
int main() {
  int n, m, cur = 0;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d %d %d", a + i, b + i, c + i);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", l + i, r + i);
    st[i] = cur;
    cur += r[i] - l[i] + 1;
    ed[i] = cur++;
  }
  int src = cur++, tar = cur++;
  dinic.init(cur, src, tar);
  dinic.calc(n, m);
}