Greg has an array a = a1, a2, ..., an and m operations. Each operation looks as: li, ri, di, (1 ≤ li ≤ ri ≤ n). To apply operation i to the array means to increase all array elements with numbers li, li + 1, ..., ri by value di.

Greg wrote down k queries on a piece of paper. Each query has the following form: xi, yi, (1 ≤ xi ≤ yi ≤ m). That means that one should apply operations with numbers xi, xi + 1, ..., yi to the array.

Now Greg is wondering, what the array a will be after all the queries are executed. Help Greg.

Input

The first line contains integers n, m, k (1 ≤ n, m, k ≤ 105). The second line contains n integers: a1, a2, ..., an (0 ≤ ai ≤ 105) — the initial array.

Next m lines contain operations, the operation number i is written as three integers: li, ri, di, (1 ≤ li ≤ ri ≤ n), (0 ≤ di ≤ 105).

Next k lines contain the queries, the query number i is written as two integers: xi, yi, (1 ≤ xi ≤ yi ≤ m).

The numbers in the lines are separated by single spaces.

Output

On a single line print n integers a1, a2, ..., an — the array after executing all the queries. Separate the printed numbers by spaces.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.

Examples

Input

3 3 3
1 2 3
1 2 1
1 3 2
2 3 4
1 2
1 3
2 3


Output

9 18 17


Input

1 1 1
1
1 1 1
1 1


Output

2


Input

4 3 6
1 2 3 4
1 2 1
2 3 2
3 4 4
1 2
1 3
2 3
1 2
1 3
2 3


Output

5 18 31 20
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        AGregAndArray solver = new AGregAndArray();
        solver.solve(1, in, out);
        out.close();
    }

    static class AGregAndArray {
        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int n, m, k;
            n = sc.nextInt();
            m = sc.nextInt();
            k = sc.nextInt();
            long[] arr = new long[n + 1];
            for (int i = 0; i < n; i++)
                arr[i] = sc.nextInt();
            triple[] operations = new triple[m];
            int[] countOpe = new int[m + 1];
            for (int i = 0; i < m; i++)
                operations[i] = new triple(sc.nextInt() - 1, sc.nextInt() - 1, sc.nextInt());
            for (int i = 0; i < k; i++) {
                int l = sc.nextInt() - 1, r = sc.nextInt() - 1;
                countOpe[l]++;
                countOpe[r + 1]--;
            }
            operations[0].count += countOpe[0];
            for (int i = 1; i < m; i++) {
                countOpe[i] += countOpe[i - 1];
                operations[i].count += countOpe[i];
            }
            long[] prefix = new long[n + 1];
            for (int i = 0; i < m; i++) {
                long val = 1l * operations[i].val * operations[i].count;
                prefix[operations[i].l] += val;
                prefix[operations[i].r + 1] -= val;
            }
            arr[0] += prefix[0];
            for (int i = 1; i < n; i++) {
                prefix[i] += prefix[i - 1];
                arr[i] += prefix[i];
            }
            for (int i = 0; i < n; i++)
                pw.print(arr[i] + " ");
        }

        public class triple {
            int l;
            int r;
            int val;
            int count;

            public triple(int l, int r, int val) {
                this.l = l;
                this.r = r;
                this.val = val;
            }

            public String toString() {
                return "triple{" +
                        "l=" + l +
                        ", r=" + r +
                        ", val=" + val +
                        '}';
            }

        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

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

    }
}

