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
/**
 * Created by Rohit on 4/14/2017.
 */
import java.io.*;
import java.util.*;
public class Codeforces295A {
    public static void main(String[] args) throws IOException {
        //File file = new File("C:/Users/Rohit/IdeaProjects/Codeforces295A/src/t1.txt");
        //Scanner scan = new Scanner(file);
        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();
        int m = scan.nextInt();
        int k = scan.nextInt();

        long[] data = new long[n];
        long[] diffs = new long[n];

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

        int[] ls = new int[m], rs = new int[m], ds = new int[m];

        for (int i = 0; i<m; i++) {
            ls[i] = scan.nextInt()-1;
            rs[i] = scan.nextInt()-1;
            ds[i] = scan.nextInt();
        }

        int[] count = new int[m];

        for (int i = 0; i<k; i++) {
            int a = scan.nextInt()-1, b = scan.nextInt()-1;
            count[a] ++;
            if (b<m-1) {
                count[b+1]--;
            }
        }

        long x = 0;

        for (int i = 0; i<m; i++) {
            x += count[i];
            diffs[ls[i]] += ds[i]*x;
            if (rs[i]<n-1) {
                diffs[rs[i]+1] -= ds[i]*x;
            }
        }

        x = 0;

        for (int i = 0; i<n; i++) {
            x += diffs[i];
            data[i] += x;
        }

        for (int i = 0; i<n; i++) {
            System.out.print(data[i] + " ");
        }
    }
}
