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.*;
import java.io.*;
public class Solution {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int k = scan.nextInt();
        int[][] operations = new int[m][3];
        int[] applications = new int[m];
        long[] carryOver = new long[n];
        long[] output = new long[n];
        for(int i = 0; i < n; i++) output[i] = scan.nextInt();        
        for(int i = 0; i < m; i++){
            operations[i][0] = scan.nextInt();
            operations[i][1] = scan.nextInt();
            operations[i][2] = scan.nextInt();
        }  
        for(int i = 0; i < k; i++){
            applications[scan.nextInt() - 1]++;
            int temp = scan.nextInt();
            if(temp != m) applications[temp]--;
        }
        for(int i = 0; i < m; i++){
            if(i != 0) applications[i] += applications[i - 1];
            carryOver[operations[i][0] - 1] += ((long) applications[i] * (long) operations[i][2]);
            if(operations[i][1] != n) carryOver[operations[i][1]] -= ((long) applications[i] * (long) operations[i][2]);
        }
        System.out.print((output[0] + carryOver[0]) + " ");
        for(int i = 1; i < n; i++){
            carryOver[i] += carryOver[i - 1];
            System.out.print((output[i] + carryOver[i]) + " ");
        }
    }
}