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

	
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int m = s.nextInt();
		int k = s.nextInt();
		s.nextLine();
		
		long[] init = new long[200005];
		long[] query = new long[200005];
		long[] visited = new long[200005];
		Node[] nodes = new Node[200005];
		
		for(int i = 1; i < n + 1; i++) {
			init[i] = s.nextInt();
		}
		
		for(int i = 1; i < m + 1; i++) {
			nodes[i] = new Node();
			nodes[i].setLeft(s.nextInt());
			nodes[i].setRight(s.nextInt() + 1);
			nodes[i].setD(s.nextInt());
		}
		
		for(int i = 0; i < k; i++) {
			int x = s.nextInt();
			int y = s.nextInt();
			visited[x]++;
			visited[y + 1]--;
		}
		
		for(int i = 1; i < m + 1; i++) {
			visited[i] += visited[i - 1];
		}
		
		for(int i = 1; i < m + 1; i++) {
			query[nodes[i].getRight()] -= nodes[i].getD() * visited[i];
			query[nodes[i].getLeft()] += nodes[i].getD() * visited[i];
			//query[nodes[i].getRight()] -= nodes[i].getD() * visited[i];
		}
		
		for(int i = 1; i < n + 1; i++) {
			query[i] = query[i - 1] + query[i];
		}
		
		System.out.print(init[1] + query[1]);
		
		for(int i = 2; i < n + 1; i++) {
			System.out.print(" " + (init[i] + query[i]));
		}
		s.close();
	}
	
	public static class Node {
		int left;
		int right;
		int d;
		
		public void setLeft(int l) {
			left = l;
		}
		
		public void setRight(int r) {
			right = r;
		}
		
		public void setD(int deez) {
			d = deez;
		}
		
		public int getLeft() {
			return left;
		}
		
		public int getRight() {
			return right;
		}
		
		public int getD() {
			return d;
		}
		
	}
}
