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.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 * Created by first on 7/16/2018.
 */
public class GregAndArray_A {
    public static void main(String [] args) throws IOException {
        BufferedReader br = new BufferedReader(
                new InputStreamReader(System.in));

        String [] inputs = br.readLine().split(" ");

        int size = Integer.parseInt(inputs[0]);
        int numOfOperations = Integer.parseInt(inputs[1]);
        int numOfQuerys = Integer.parseInt(inputs[2]);
        int [] arr = new int[size];
        long[] tempArr = new long[size];
        long[] sumArr = new long[size];

        long[] rangeTempArr = new long[numOfOperations];
        long[]  timeToDoOperation = new long[numOfOperations];

        int [] leftArr = new int[numOfOperations];
        int [] rightArr = new int[numOfOperations];
        int [] addValueArr = new int[numOfOperations];

        inputs = br.readLine().split(" ");
        for (int i = 0; i < size; i++) {
            arr[i] = Integer.parseInt(inputs[i]);
            tempArr[i] = 0;
        }

        for (int i = 0; i < numOfOperations; i++) {
            inputs = br.readLine().split(" ");
            leftArr[i] = Integer.parseInt(inputs[0]);
            rightArr[i] = Integer.parseInt(inputs[1]);
            addValueArr[i] = Integer.parseInt(inputs[2]);

            rangeTempArr[i] = 0;
            timeToDoOperation[i] = 0;
        }

        for (int i = 0; i < numOfQuerys; i++) {
            inputs = br.readLine().split(" ");
            int left = Integer.parseInt(inputs[0]);
            int right = Integer.parseInt(inputs[1]);

            rangeTempArr[left-1] += 1;
            if(right <numOfOperations){
                rangeTempArr[right] -= 1;
            }
            /*for (int j = left - 1; j < right; j++) {
                tempArr[leftArr[j] - 1] += addValueArr[j];
                if(rightArr[j] < size) {
                   tempArr[rightArr[j]] -= addValueArr[j];
                }
            }*/
        }
        timeToDoOperation[0] = rangeTempArr[0];
        for (int i = 1; i < numOfOperations; i++) {
            timeToDoOperation[i] = rangeTempArr[i] + timeToDoOperation[i -1];
        }
        for (int i = 0; i < numOfOperations; i++) {
            long val = addValueArr[i];
            if(timeToDoOperation[i] >= 0){
                val *= timeToDoOperation[i];
            }
            tempArr[leftArr[i] - 1] += val;
            if(rightArr[i] < size) {
                tempArr[rightArr[i]] -= val;
            }
        }

        sumArr[0] = tempArr[0];
        for (int i = 1; i < size; i++) {
            sumArr[i] = tempArr[i] + sumArr[i -1];
        }
        for (int i = 0; i < size; i++) {
            System.out.print(sumArr[i] + arr[i]  + " ");
        }

    }
}
