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.*;
import java.util.*;
public class Task295A {

	PrintWriter out;
	BufferedReader input;
	Task295A() {
		input = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		try {
			solver();
		} catch(IOException ex) {}
		out.close();
	}
	StringTokenizer st = new StringTokenizer("");
	private String nextToken() throws IOException{
		while (!st.hasMoreElements()) {
			st = new StringTokenizer(input.readLine());
		}
		return st.nextToken();
	}
	private int nextInt() throws IOException{
		return Integer.parseInt(nextToken());
	}
	String[] op;
	int[] arr;
	int[] b;
	public void solver() throws IOException{
		int n = nextInt();
		int m = nextInt();
		int k = nextInt();
		arr = new int[n];
		b = new int[m];
		for (int i = 0; i < n; i++) {
			arr[i] = nextInt();
		}
		op = new String[m];
		for (int i = 0; i < m; i++) {
			op[i] = input.readLine();
		}
		for (int i = 0; i < k; i++) {
			int from = nextInt()-1;
			int to = nextInt();
			b[from]++;
			if (to < m)
				b[to]--;
		}
		for (int i = 1; i < m; i++) {
			b[i] += b[i-1];
		}
		long[] tb = new long[n];
		for (int i = 0; i < m; i++) {
			String t = op[i];
			String[] rez = t.split(" ");
			int lf = Integer.parseInt(rez[0])-1;
			int r = Integer.parseInt(rez[1]);
			int d = Integer.parseInt(rez[2]);
			long tt = (long) b[i] * d;
			tb[lf] += tt;
			if (r < n)
				tb[r] -= tt;
		}
		for (int i = 1; i < n; i++) {
			tb[i] += tb[i-1];
		}
		for (int i = 0; i < n; i++) {
			out.print(arr[i] + tb[i] + " ");
		}
	}
	public static void main(String[] args) {
		new Task295A();
	}

}
