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 GregArray {
	
	public static class Op {
		
		int start, end, val;
		
		public Op(int begin, int finish, int value) {
			start = begin;
			end = finish;
			val = value;
		}
		
	}
	
        public static void main(String[] args) {
        	
            Scanner sc = new Scanner(System.in);
            long[] array = new long[sc.nextInt()+1];
            Op[] ops = new Op[sc.nextInt()+1];
            int[] reps = new int[ops.length+1];
            int queue = sc.nextInt();
            
            for (int a = 1; a < array.length; a++) {
            	array[a] = sc.nextLong();
            }
            
            for (int a = 1; a < ops.length; a++) {
            	ops[a] = new Op(sc.nextInt(), sc.nextInt(), sc.nextInt());
            }
            
            for (int a = 0; a < queue; a++) {
            	int start = sc.nextInt();
            	int end = sc.nextInt()+1;
            	reps[start]+=1;
            	reps[end]-=1;
            }
            
            long thisManyTimes = 0;
            long[] addThis = new long[array.length+1];
            
            for (int a = 1; a < ops.length; a++) {
            	thisManyTimes += reps[a];
            	if (thisManyTimes > 0) {
            		int start = ops[a].start;
            		int end = ops[a].end+1;
            		long val = ops[a].val*thisManyTimes;
            		addThis[start] += val;
            		addThis[end] -= val;
            	}
            }
            
            thisManyTimes = 0;
            for (int a = 1; a < array.length; a++) {
            	thisManyTimes += addThis[a];
            	array[a] += thisManyTimes;
            }
            
            StringBuilder sb = new StringBuilder();
            for (int a = 1; a < array.length; a++) {
            	sb.append(array[a] + " ");
            }
            
            System.out.println(sb.toString());
            sc.close();
        }
}