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

public class Main
{
    public static void main(String[] args) throws IOException
    {
        Reader.init(System.in);
        int n = Reader.nextInt();
        int m = Reader.nextInt();
        int k = Reader.nextInt();
        int[] arr = new int[n+1];
        int[] L = new int[m+1];
		int[] R = new int[m+1];
		int[] D = new int[m+1];
		for(int i = 1; i <= n; i++)
		{
		    arr[i] = Reader.nextInt();
		}
		for(int i = 1; i <= m; i++)
		{
		    L[i] = Reader.nextInt();
		    R[i] = Reader.nextInt();
		    D[i] = Reader.nextInt();
		}
		long[] queries = new long[m+2];
		for(int i = 0; i < k; i++)
		{
		    int l = Reader.nextInt();
		    int r = Reader.nextInt();
		    queries[l]++;
		    queries[r+1]--;
		}
		for(int i = 1; i <= m; i++)
		{
		    queries[i] += queries[i-1];
		}
		long[] ans = new long[n+2];
		for(int i = 1; i <= m; i++)
		{
		    ans[L[i]] += queries[i]*D[i];
		    ans[R[i] + 1] -= queries[i]*D[i];
		}
		for(int i = 1; i <= n; i++)
		{
			ans[i] += ans[i-1];
		}
		for(int i = 1; i <= n; i++)
		{
		    System.out.print(ans[i] + arr[i] + " ");
		}
    }
}

class Reader
{
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    
    static void init(InputStream input)
    {
        reader = new BufferedReader(new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }
    
    static String next() throws IOException
    {
        while(!tokenizer.hasMoreTokens())
        {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
    
    static int nextInt() throws IOException
    {
        return Integer.parseInt(next());
    }
    
    static long nextLong() throws IOException
    {
        return Long.parseLong(next());
    }
    
    static double nextDouble() throws IOException
    {
        return Double.parseDouble(next());
    }
}