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.*;
import java.util.StringTokenizer;

/**
 * Created by Artem on 15.12.2015.
 */
public class P295A {

    public static void main(String[] args) {
        P295A solver = new P295A();

    }

    public P295A() {
        FastReader in = new FastReader(System.in);
        FastWriter out = new FastWriter(System.out);


        int n, m, k;

        n = in.nextInt();
        m = in.nextInt();
        k = in.nextInt();

        int a[] = new int[n];

        int l[] = new int[m + 1];
        int r[] = new int[m + 1];
        int d[] = new int[m + 1];

        int open[] = new int[m + 2];
        int count[] = new int[m + 2];

        for (int i = 0 ; i < n; i ++)
        {
            a[i] = in.nextInt();
        }

        for (int i = 0; i < m; i++) {
            l[i] = in.nextInt();
            r[i] = in.nextInt();
            d[i] = in.nextInt();
        }

        int left, right;

        long add[] = new long[n + 2];

        for (int i = 0; i < k; i++) {
            left = in.nextInt();
            right = in.nextInt();

            open[left]++;
            open[right + 1]--;
        }

        int cc = 0;
        for (int i = 1; i < m + 1; i++) {
            cc = cc + open[i];
            count[i] = cc;
        }

        for (int i = 0; i < m; i++) {
            int num = count[i + 1];

            add[l[i]] += (long)d[i] * (long)num;
            add[r[i] + 1] -= (long) d[i] * (long)num;

        }

        long ans = 0;
        for (int i = 0 ; i < n; i ++)
        {
            ans += add[i + 1];
            long curr = ans + a[i];
            out.print(curr + " ");
        }

        out.close();


    }


    class FastReader extends BufferedReader {

        private StringTokenizer stringTokenizer;

        public FastReader(InputStream inputStream) {
            super(new InputStreamReader(inputStream));
        }

        public String nextToken() {
            try {
                while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
                    stringTokenizer = new StringTokenizer(readLine());
                }
                return stringTokenizer.nextToken();
            } catch (IOException e) {
                return null;
            }
        }

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

    }

    class FastWriter extends PrintWriter {

        public FastWriter(OutputStream out) {
            super(out);
        }
    }
}
