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.util.ArrayList;
import java.util.StringTokenizer;

public class Greg {
	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	static class operations {
		int l = 0;
		int r = 0;
		int d = 0;
	}

	public static void main(String[] args) {
		FastReader scn = new FastReader();
		int n = scn.nextInt();
		int m = scn.nextInt();
		int k = scn.nextInt();
		long[] arr = new long[n];
		long[] sumArr = new long[n];
		long[] query = new long[m];
		ArrayList<operations> op = new ArrayList<operations>();
		long sum = 0;
		for (int i = 0; i < n; i++) {
			arr[i] = scn.nextLong();
			sum = sum + arr[i];
			sumArr[i] = sum;
		}
		for (int i = 0; i < m; i++) {
			operations oper = new operations();
			oper.l = scn.nextInt();
			oper.r = scn.nextInt();
			oper.d = scn.nextInt();
			op.add(oper);
		}
		for (int i = 0; i < k; i++) {
			int x = scn.nextInt();
			int y = scn.nextInt();
			query[x - 1]++;
			if (y < m) {
				query[y]--;
			}
		}
		sum = 0;
		for (int i = 0; i < m; i++) {
			sum = sum + query[i];
			query[i] = sum;
		}
		for (int i = 0; i < m; i++) {

			operations o = op.get(i);
			arr[o.l - 1] = arr[o.l - 1] + o.d * query[i];
			if (o.r < n) {
				arr[o.r] = arr[o.r] - o.d * query[i];
			}

		}
		sum = 0;
		for (int i = 0; i < n; i++) {
			sum = sum + arr[i];
			arr[i] = sum;
			if (i > 0) {
				arr[i] = arr[i] - sumArr[i - 1];
			}
		}
		for (int i = 0; i < n; i++) {
			System.out.print(arr[i]);
			if (i < arr.length - 1) {
				System.out.print(" ");
			}
		}
	}
}
