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.Arrays;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int m = sc.nextInt();
		int k = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i] = sc.nextInt();
		}
		int[] l = new int[m];
		int[] r = new int[m];
		int[] d = new int[m];
		for (int i = 0; i < m; i++) {
			l[i] = sc.nextInt() - 1;
			r[i] = sc.nextInt() - 1;
			d[i] = sc.nextInt();
		}
		int[] x = new int[k];
		int[] y = new int[k];
		for (int i = 0; i < k; i++) {
			x[i] = sc.nextInt() - 1;
			y[i] = sc.nextInt() - 1;
		}
		System.out.println(solve(a, l, r, d, x, y));

		sc.close();
	}

	static String solve(int[] a, int[] l, int[] r, int[] d, int[] x, int[] y) {
		int m = l.length;
		int k = x.length;

		long[] operationNums = batchModify(new int[m], x, y, IntStream.range(0, k).mapToLong(i -> 1).toArray());
		long[] additions = IntStream.range(0, m).mapToLong(i -> d[i] * operationNums[i]).toArray();
		long[] result = batchModify(a, l, r, additions);

		return Arrays.stream(result).mapToObj(String::valueOf).collect(Collectors.joining(" "));
	}

	static long[] batchModify(int[] initial, int[] beginIndices, int[] endIndices, long[] additions) {
		int length = initial.length;

		long[] deltas = new long[length];
		for (int i = 0; i < beginIndices.length; i++) {
			deltas[beginIndices[i]] += additions[i];

			if (endIndices[i] != length - 1) {
				deltas[endIndices[i] + 1] -= additions[i];
			}
		}

		long[] result = new long[length];
		long offset = 0;
		for (int i = 0; i < result.length; i++) {
			offset += deltas[i];
			result[i] = initial[i] + offset;
		}

		return result;
	}
}
