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.util.Scanner;

/**
 * Created by rushi on 12/1/17.
 */
public class Problem295A {

    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int k = scan.nextInt();

        // okay so the idea is
        // when you traverse from left to right
        // overlapping changes will interact with each other
        // so keep track of the beginning and end of each change
        // and as you go through use those to update what the net change is for each element
        // to do so you need to keep track of the current net change for a cell
        // update that at each point if there is a beginning/end of a section

        // initial array
        long[] arr = new long[n];

        //operations
        int[] lis = new int[m];
        int[] ris = new int[m];
        long[] dis = new long[m];

        long[] dp = new long[n + 1]; // sum from 0 to i of dp is net change to each arr[i]

        // queries
        long[] queries = new long[m + 1];

        for(int i = 0; i < n; i++){
            arr[i] = scan.nextLong();
        }
        for(int i = 0; i < m; i++){
            lis[i] = scan.nextInt();
            ris[i] = scan.nextInt();
            dis[i] = scan.nextLong();
        }
        for(int i = 0; i < k; i++){
            int xi = scan.nextInt();
            int yi = scan.nextInt();
            queries[xi - 1]++;
            queries[yi]--;
        }

        // this is weird
        long sum = 0;
        for(int i = 0; i < m; i++){
            sum += queries[i]; // why are we summing here rather than just queries[i]?
            dp[lis[i] - 1] += sum * dis[i];
            dp[ris[i]] -= sum * dis[i];
        }

        long netChange = 0;
        for(int i = 0; i < arr.length; i++){
            netChange += dp[i];
            System.out.print((arr[i] + netChange) + " ");
        }
    }
}
