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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * Created by Xinyu Zhao on 12/2/2017.
 */
public class GregAndArray {
    public static void main(String[] args) throws IOException {
        final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer line = new StringTokenizer(br.readLine());
        int arraySize = Integer.parseInt(line.nextToken());
        int numOperations = Integer.parseInt(line.nextToken());
        int numQueries = Integer.parseInt(line.nextToken());

        int arr[] = new int[arraySize + 1];
        int ops[][] = new int[numOperations + 1][3];

        line = new StringTokenizer(br.readLine());
        for(int i = 1; i <= arraySize; i++) {
            arr[i] = Integer.parseInt(line.nextToken());
        }
        //System.out.println(Arrays.toString(arr));
        for(int i = 1; i <= numOperations; i++) {
            line = new StringTokenizer(br.readLine());
            for(int j = 0; j < 3; j++) {
                ops[i][j] = Integer.parseInt(line.nextToken());
            }
        }
        //System.out.println(Arrays.deepToString(ops));
        int opFreq[] = new int[numOperations + 1];
        // Queries.
        for (int i = 0; i < numQueries; i++) {
            line = new StringTokenizer(br.readLine());
            int x = Integer.parseInt(line.nextToken());
            int y = Integer.parseInt(line.nextToken());
            opFreq[x-1]++;
            opFreq[y] --;
        }
        //System.out.println(Arrays.toString(opFreq));

        long[] netChanges = new long[arraySize + 1];
        int netOpFreq = opFreq[0];
        // Queries.
        for (int i = 1; i <= numOperations; i++) {
            //System.out.println(Arrays.toString(ops[j]));
            int l = ops[i][0];
            int r = ops[i][1];
            long d = ops[i][2];
            netChanges[l - 1] += d * netOpFreq;
            netChanges[r] -= d * netOpFreq;
            netOpFreq += opFreq[i];
            //System.out.println(Arrays.toString(netChanges));
        }
        long netChange = netChanges[0];
        for(int i = 1; i <= arraySize; i++) {
            //System.out.println(arr[i] + " + " + netChange);
            long output = arr[i] + netChange;
            netChange += netChanges[i];
            System.out.print(output + " ");
        }
    }
}
