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.*;
import java.io.*;

public class L10
{
    int n, m, k;
    long[] a, del, app, add;
    int[][] rng;

    L10(Scanner in, PrintWriter out)
    {
    	n = in.nextInt();
        m = in.nextInt();
        k = in.nextInt();
        
        a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = in.nextLong();
        rng = new int[m][2];
        del = new long[m];
        for (int i = 0; i < m; i++)
        {
            rng[i][0] = in.nextInt()-1;
            rng[i][1] = in.nextInt();
            del[i] = in.nextLong();
        }
        
        app = new long[m+1];
        for (int i = 0; i < k; i++)
        {
            app[in.nextInt()-1]++;
            app[in.nextInt()]--;
        }
        for (int i = 1; i < m+1; i++)
            app[i] += app[i-1];
        
        add = new long[n+1];
        for (int i = 0; i < m; i++)
        {
            del[i] *= app[i];
            add[rng[i][0]] += del[i];
            add[rng[i][1]] -= del[i];
        }
        for (int i = 1; i < n+1; i++)
            add[i] += add[i-1];
            
        for (int i = 0; i < n; i++)
            out.print((a[i]+add[i])+" ");
    }
	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		new	L10(in, out);
		out.close();
	} 
}