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.Scanner;

public class GregAndArray 
{
	static Scanner sc = new Scanner(System.in);
	static int n;
	static int m;
	static int k;
	static long[] a;
	static int[] opl;
	static int[] opr;
	static int[] opd;
	static long[] ramp;
	static long[] ramp2;

	public static void main(String[] args) 
	{
		n = sc.nextInt();
		m = sc.nextInt();
		k = sc.nextInt();
		
		a = new long[n];
		ramp = new long[n];
		ramp2 = new long[m];
		opl = new int[m];
		opr = new int[m];
		opd = new int[m];
		
		//4816941527
		//521974231
		
		for(int i = 0; i < n; i++)
		{
			a[i] = sc.nextInt();
		}
		
		for(int i = 0; i < m; i++)
		{ //read operations
			opl[i] = sc.nextInt()-1;
			opr[i] = sc.nextInt()-1;
			opd[i] = sc.nextInt();
		}
		
		for(int i = 0; i < k; i++)
		{ //read queries
			int x = sc.nextInt()-1;
			int y = sc.nextInt()-1;
			ramp2[x] += 1;
			if(y+1 < m)ramp2[y+1] -= 1;
		}
		
		StringBuilder sb = new StringBuilder("");
		
		//read ramp2 to figure out how many times each op is executed.
		long velocity = 0;
		for(int i = 0; i < m; i++)
		{ //output
			velocity += ramp2[i];
			
			ramp[(int)opl[i]] += opd[i] * velocity;
			if(opr[i]+1 < n)ramp[(int)opr[i]+1] -= opd[i] * velocity;
		}
		
		velocity = 0;
		for(int i = 0; i < n; i++)
		{ //output
			velocity += ramp[i];
			
			a[i] += velocity;
			
			sb.append(a[i]);
			if(i < n-1)
			{
				sb.append(" ");
			}
		}
		
		System.out.println(sb);
		
	}

}
