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 JAVA):

Solution:
import java.io.*;
import java.math.*;
import java.util.*;

public class Main {
    public void run() {
        try {
            int n = reader.nextInt();
            int q = reader.nextInt();
            int[] a = new int[n];
            int[] b = new int[n];
            int[] c = new int[n];
            for (int i = 0; i < n; ++ i) {
                a[i] = reader.nextInt();
                b[i] = reader.nextInt();
                c[i] = reader.nextInt();
            }
            int[] l = new int[n];
            int[] r = new int[n];
            int verticesCount  = 0;
            int offset = Integer.MIN_VALUE;
            int[] start = new int[n];
            for (int i = 0; i < n; ++ i) {
                l[i] = reader.nextInt();
                r[i] = reader.nextInt();
                for (int x = l[i]; x <= r[i]; ++ x) {
                    offset = Math.max(offset, a[i] * x * x + b[i] * x + c[i]);
                }
                start[i] = verticesCount;
                verticesCount += r[i] - l[i] + 2;
            }
            Network network = new Network(verticesCount + 2);
            int source = verticesCount;
            int target = source + 1;
            int[][] vertices = new int[n][];
            for (int i = 0; i < n; ++ i) {
                int m = r[i] - l[i] + 1;
                vertices[i] = new int[m + 1];
                for (int j = 0; j <= m; ++ j) {
                    vertices[i][j] = start[i] + j;
                }
                for (int j = 0; j < m; ++ j) {
                    int x = l[i] + j;
                    network.addEdge(vertices[i][j], vertices[i][j + 1], offset - (a[i] * x * x + b[i] * x + c[i]));
                }
                network.addEdge(source, vertices[i][0], Integer.MAX_VALUE);
                network.addEdge(vertices[i][m], target, Integer.MAX_VALUE);
            }
            for (int i = 0; i < q; ++ i) {
                int u = reader.nextInt() - 1;
                int v = reader.nextInt() - 1;
                int d = reader.nextInt();
                for (int j = l[u]; j <= r[u]; ++ j) {
                    int k = Math.min(j - d, r[v] + 1);
                    if (l[v] <= k) {
                        network.addEdge(vertices[u][j - l[u]], vertices[v][k - l[v]], Integer.MAX_VALUE);
                    }
                }
            }
            writer.println(n * offset - network.getMaxFlow(source, target));
        } catch (IOException ex) {
        }
        writer.close();
    }

    class Network {
        public void addEdge(int from, int to, int capacity) {
            Edge e = new Edge(to, capacity);
            Edge f = new Edge(from, 0);
            e.back = f;
            edges.get(from).add(e);
            f.back = e;
            edges.get(to).add(f);
        }

        public int getMaxFlow(int source, int target) {
            int[] level = new int[n];
            int[] queue = new int[n];
            int result = 0;
            while (true) {
                Arrays.fill(level, -1);
                level[target] = 0;
                int tail = 0;
                queue[tail ++] = target;
                for (int head = 0; head < tail && level[source] == -1; ++ head) {
                    int v = queue[head];
                    for (Edge e : edges.get(v)) {
                        int u = e.to;
                        if (e.back.capacity > 0 && level[u] == -1) {
                            level[u] = level[v] + 1;
                            queue[tail ++] = u;
                        }
                    }
                }
                if (level[source] == -1) {
                    break;
                }
                result += augment(level, source, target, Integer.MAX_VALUE);
            }
            return result;
        }

        private int augment(int[] level, int u, int target, int left) {
            if (u == target) {
                return left;
            }
            int delta = 0;
            for (Edge e : edges.get(u)) {
                if (e.capacity > 0 && level[u] == level[e.to] + 1) {
                    int result = augment(level, e.to, target, Math.min(left - delta, e.capacity));
                    e.capacity -= result;
                    e.back.capacity += result;
                    delta += result;
                    if (delta == left) {
                        return delta;
                    }
                }
            }
            level[u] = -1;
            return delta;
        }

        Network(int n) {
            this.n = n;
            edges = new ArrayList <List <Edge>>();
            for (int i = 0; i < n; ++ i) {
                edges.add(new ArrayList <Edge>());
            }
        }

        class Edge {
            Edge(int to, int capacity) {
                this.to = to;
                this.capacity = capacity;
            }

            int  to, capacity;
            Edge back;
        }

        int n;
        List <List <Edge>> edges;
    }

    Main() {
        reader = new InputReader(System.in);
        writer = new PrintWriter(System.out);
    }

    public static void main(String[] args) {
        new Main().run();
    }

    private void debug(Object...os) {
        System.err.println(Arrays.deepToString(os));
    }

    private InputReader reader;
    private PrintWriter writer;
}

class InputReader {
    InputReader(InputStream in) {
        reader    = new BufferedReader(new InputStreamReader(in));
        tokenizer = new StringTokenizer("");
    }

    private String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    public Integer nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    private BufferedReader  reader;
    private StringTokenizer tokenizer;
}