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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class GregAndArray {

	
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		
		StringTokenizer s = new StringTokenizer(in.readLine());
		int n = Integer.parseInt(s.nextToken());
		int m = Integer.parseInt(s.nextToken());
		int k = Integer.parseInt(s.nextToken());
		
		int[] arr = new int[n];
		s = new StringTokenizer(in.readLine());
		for (int i = 0; i < n; i++) {
			arr[i] = Integer.parseInt(s.nextToken());
		}
		
		Operation[] op = new Operation[m];
		for (int i = 0; i < m; i++) {
			s = new StringTokenizer(in.readLine());
			int l = Integer.parseInt(s.nextToken()) - 1;
			int r = Integer.parseInt(s.nextToken()) - 1;
			int d = Integer.parseInt(s.nextToken());
			
			op[i] = new Operation(l, r, d);
		}
		
		long[] off = new long[n];
		int[] opc = new int[m];
		for (int i = 0; i < k; i++) {
			s = new StringTokenizer(in.readLine());
			int l = Integer.parseInt(s.nextToken()) - 1;
			int r = Integer.parseInt(s.nextToken()) - 1;
			
			opc[l]++;
			if(r != m - 1)
				opc[r + 1]--;
		}
		
		for (int i = 1; i < m; i++)
			opc[i] += opc[i - 1];

		for (int i = 0; i < m; i++) {
			Operation o = op[i];
			
			off[o.l] += ((long)o.d * opc[i]);
			if(o.r != n - 1)
				off[o.r + 1] -= ((long)o.d * opc[i]);
		}
		
		for (int i = 1; i < n; i++)
			off[i] += off[i - 1];
		
		for (int i = 0; i < n; i++) {
			out.print((arr[i] + off[i]) + " ");
		}
		
		out.flush();
		out.close();
	}
	
	private static class Operation {
		int l, r, d;
		
		public Operation(int l, int r, int d) {
			this.l = l;
			this.r = r;
			this.d = d;
		}	
	}
}
