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 Solution {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		int k = in.nextInt();
		int[] a = new int[n+1];
		int[] b = new int[m+1];
		int[] c = new int[m+1];
		int[] d = new int[m+1];
		long[] q = new long[m+2];
		long[] q0 = new long[n+2];
		
		for(int i = 1; i <= n; i++){
			a[i] = in.nextInt();
		}
		for(int i = 1; i <= m; i++){
			b[i] = in.nextInt();
			c[i] = in.nextInt();
			d[i] = in.nextInt();
		}
		for(int i = 1; i <= k; i++){
			int x = in.nextInt();
			int y = in.nextInt();
			q[x]++;
			q[y+1]--;
		}
		for(int i = 1; i <=m; i++){
			q[i] += q[i-1];
			q0[b[i]] += q[i]*d[i];
			q0[c[i]+1] -= q[i]*d[i];
		}
		for(int i =1; i <= n; i++){
			q0[i] += q0[i-1];
			System.out.print(q0[i] + a[i] + " ");
		}
		

	}
}