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.*;

public class GregArray295A
{
    public static void main(String[] args) 
    {
        // Set up scanner
        Scanner sc = new Scanner(System.in); 
        // System.out.println("Enter n");   // Size of array
        int n = sc.nextInt();
        // System.out.println("Enter m");   // Number of operations/Size of querymatrices
        int m = sc.nextInt();
        // System.out.println("Enter k");   // Number of queries
        int k = sc.nextInt();
        
        long[] a = new long[n+1];
        for (int i=1; i<=n; i++)
        {
            // System.out.println("Enter next array value");
            a[i] = sc.nextLong();
        }
        
        int[] operationl = new int[m+1];
        int[] operationr = new int[m+1];
        long[] operationd = new long[m+1];
        for (int i=1; i<=m; i++)
        {
            // System.out.println("Enter next l");
            operationl[i] = sc.nextInt();
            // System.out.println("Enter next r");
            operationr[i] = sc.nextInt();
            // System.out.println("Enter next d");
            operationd[i] = sc.nextLong();
        }
        
        int[] querystart = new int[m+1];
        int[] queryfinish = new int[m+1];
        // The query loop (executed first)
        for (int i=0; i<k; i++)
        {
            // System.out.println("Enter x of query");
            int x = sc.nextInt();
            // System.out.println("Enter y of query");
            int y = sc.nextInt();
            querystart[x]++;
            queryfinish[y]++;
        }
        
        // Now loop over the query arrays, and apply the appropriate operation the correct number of times
        long[] arraystart = new long[n+1];
        long[] arrayfinish = new long[n+1];
        
        int timesexecuted = 0;
        for (int i=1; i<=m; i++)
        {
            timesexecuted += querystart[i];
            timesexecuted -= queryfinish[i-1];
            int startpos = operationl[i];
            int finishpos = operationr[i];
            long toadd = operationd[i];
            arraystart[startpos] += timesexecuted * toadd;
            arrayfinish[finishpos] += timesexecuted * toadd;
        }
        
        // Finally we can print out the final array
        long amounttoadd = 0;
        StringBuilder sb = new StringBuilder();
        for (int i=1; i<=n; i++)
        {
            amounttoadd += arraystart[i];
            amounttoadd -= arrayfinish[i-1];
            sb.append((a[i] + amounttoadd) + " ");
        }
        System.out.println(sb);
    }
}
            
        
        
        
            
            