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.security.KeyStore.Entry;
import java.text.DecimalFormat;
import java.text.NumberFormat;
import java.util.*;
import java.io.*;


public class temp {
   public static void main(String[] args) throws IOException
   {BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
       StringTokenizer st = new StringTokenizer(br.readLine());
       int n = Integer.parseInt(st.nextToken());
       int m = Integer.parseInt(st.nextToken());
       int k = Integer.parseInt(st.nextToken());
       long[] arr = new long[n];
       long[][] operation = new long[m][4];
       st = new StringTokenizer(br.readLine());
       for(int i =0;i<n;i++)
       {
           arr[i] = Integer.parseInt(st.nextToken());
       }
       for(int i =0;i<m;i++)
       {
           st = new StringTokenizer(br.readLine());
           operation[i][0] = Long.parseLong(st.nextToken());
           operation[i][1]=Long.parseLong(st.nextToken());
           operation[i][2]=Long.parseLong(st.nextToken());
       }
       long[][] blackops = new long[m][2];
       for(int z =0;z<k;z++)
       {
           st = new StringTokenizer(br.readLine());
           int x = Integer.parseInt(st.nextToken());
           int y = Integer.parseInt(st.nextToken());
           // code goes here
           blackops[x-1][0]++;
           blackops[y-1][1]--;
       }
       long Mt = 0;
       // Refresh the operations
       for(int i =0;i<m;i++)
       {
    	  Mt+=blackops[i][0];
    	  operation[i][3]=Mt;
    	  Mt+=blackops[i][1];
       }
       long[][] concs = new long[n][2];
       Mt =0;
       // populate the To-be concs
       for(int i =0;i<m;i++)
       {
    	   concs[(int)operation[i][0]-1][0]+=operation[i][3]*operation[i][2];
    	   concs[(int)operation[i][1]-1][1]-=operation[i][3]*operation[i][2];
       }
       long mult = 0;
       for(int i =0 ;i<n;i++)
       {
    	   mult+=concs[i][0];
    	   arr[i]+=mult;
    	   mult+=concs[i][1];
       }
       long cc = 69909770378l;
       PrintWriter out = new PrintWriter(System.out);
       for(long i : arr)
       {
          out.append(i+" ");
       }
       out.flush();
       br.close();
   }
}