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
// package FenwickTree;

import javafx.util.Pair;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;

public class GregArray {
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        HashMap<Pair<Integer,Integer>,Integer> map=new HashMap<>();
        String line[]=br.readLine().split(" ");
        int n=Integer.parseInt(line[0]);
        int m=Integer.parseInt(line[1]);
        int k=Integer.parseInt(line[2]);
        line=br.readLine().split(" ");
        int a[]=new int[n+1];
        long b[]=new long[n+2];
        for(int i=1;i<=n;i++){
            a[i]=Integer.parseInt(line[i-1]);
        }
        int l[]=new int[m+1];
        int r[]=new int[m+1];
        int d[]=new int[m+1];
        int q[]=new int[m+2];
        for(int i=1;i<=m;i++){
            line=br.readLine().split(" ");
            l[i]=Integer.parseInt(line[0]);
            r[i]=Integer.parseInt(line[1]);
            d[i]=Integer.parseInt(line[2]);
        }
        for(int i=1;i<=k;i++){
            line=br.readLine().split(" ");
            int x=Integer.parseInt(line[0]);
            int y=Integer.parseInt(line[1]);
            q[x]+=1;
            q[y+1]-=1;
        }
        for(int i=1;i<=m;i++){
            q[i]=q[i]+q[i-1];
        }
        for(int i=1;i<=m;i++){
            b[l[i]]+=(long)q[i]*d[i];
            b[r[i]+1]-=(long)q[i]*d[i];
        }
        for(int i=1;i<=n;i++){
            b[i]+=b[i-1];
            System.out.print(a[i]+b[i]+" ");
        }
        System.out.println();
    }
}
