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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

import static java.lang.Math.abs;
import static java.lang.Math.negateExact;

public class A {

    public static void main(String[] args) {

        MyScanner in = new MyScanner();

        int n = in.nextInt();
        int m = in.nextInt();
        int k = in.nextInt();

        long[] a = new long[n];

        for(int i=0;i<a.length;++i){
            a[i] = in.nextInt();
        }

        int[] l = new int[m];
        int[] r = new int[m];
        int[] d = new int[m];

        for(int i=0;i<m;++i){
            l[i] = in.nextInt()-1;
            r[i] = in.nextInt()-1;
            d[i] = in.nextInt();
        }

        int[] opStart = new int[m];
        int[] opEnd = new int[m];

        int[] opExecutedTimes = new int[m];
        for(int i=0;i<k;++i){
            opStart[in.nextInt()-1]++;
            opEnd[in.nextInt()-1]++;
        }


        int currCnt = 0;
        for(int i=0;i<m;++i){
            currCnt+=opStart[i];
            opExecutedTimes[i]+=currCnt;
            currCnt-=opEnd[i];
        }

        long[] add = new long[n];
        long[] dec = new long[n];


        for(int i=0;i<m;++i){
            add[l[i]]+=1L*d[i]*opExecutedTimes[i];
            dec[r[i]]+=1L*d[i]*opExecutedTimes[i];
        }

        long curr = 0;
        for(int i=0;i<n;++i){
            curr += add[i];
            a[i] += curr;
            System.out.print(a[i]+" ");
            curr -= dec[i];
        }


    }


    // -----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
    // --------------------------------------------------------

}