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 Segment
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int k = in.nextInt();
        ArrayList<Long> el = new ArrayList<Long>();
        ArrayList<Long> arr = new ArrayList<Long>();
        ArrayList<Long> dee = new ArrayList<Long>();
        el.add((long)0);
        arr.add((long)0);
        dee.add((long)0);
        long[] inputArr = new long[n+1];
        
        //copy initial array
        for(int i = 1; i < n+1; i++)
        {
            inputArr[i] = in.nextLong();
        }
        
        //deal with the operations
        for(int i = 0; i < m; i++)
        {
            long l = in.nextLong();
            long r = in.nextLong();
            long d = in.nextLong();
            el.add(l);
            arr.add(r);
            dee.add(d);
        }

        long[] numOperationStart = new long[m+2];  
        //deal with queries
        for(int i = 0; i < k; i++)
        {
            int x = in.nextInt();
            int y = in.nextInt();
            
            numOperationStart[x]++;
            numOperationStart[y+1]--;
        }
        
        long[] uses = new long[m+1];
        
        for(int i = 1; i < m+1; i++)
        {
            uses[i] = uses[i-1] + numOperationStart[i];
        }
        
        long[] numUpdates = new long[n+2];
        for(int i = 1; i < m+1; i++)
        {
            long start = el.get(i);
            long end = arr.get(i);
            long val = dee.get(i);
            
            numUpdates[(int)start] += uses[i]*val;
            numUpdates[(int)end+1]-=uses[i]*val;
        }
        
        long[] addAmount = new long[n+1];
        for(int i = 1; i < n+1; i++)
        {
            addAmount[i] = addAmount[i-1]+numUpdates[i];
        }
        
        for(int i = 1; i < n+1; i++)
        {
            inputArr[i]+=addAmount[i];
        }
        
        for(int i = 1; i < n+1; i++)
        {
            System.out.print(inputArr[i]+" ");
        }
    }
    
    /*public static void populate(int[] input, int index)
    {
        for(int i = index; i >= 0; i--)
        {
            input[]
        }
    }*/
}