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.*;
public class Codeforces {
  public static void main(String args[]) {
    Scanner sc = new Scanner(System.in);
    int numElems = sc.nextInt();
    int numOps = sc.nextInt();
    int numQueries = sc.nextInt();
    long[] array = new long[numElems];
    for(int i = 0; i < numElems; i++){
      array[i] = sc.nextLong();
    }

    Op[] operations = new Op[numOps];
    for(int i = 0; i < numOps; i++){
      int l = sc.nextInt();
      int r = sc.nextInt();
      int v = sc.nextInt();
      operations[i] = new Op(l, r, v);
    }

    long[] numTimesOpUsed = new long[numOps+1];
    for(int i = 0; i < numQueries; i++){
      int l = sc.nextInt();
      int r = sc.nextInt();
      numTimesOpUsed[l-1]++;
      numTimesOpUsed[r]--;
    }
    //System.out.println(numTimesOpUsed[0]);
    for(int i = 1; i < numOps; i++){
      numTimesOpUsed[i] += numTimesOpUsed[i-1];
      //System.out.println(numTimesOpUsed[i]);
    }
    long[] newArray = new long[numElems+1];
    for(int i = 0; i < numOps; i++){
      long newVal = operations[i].val * numTimesOpUsed[i];
      int l = operations[i].lower-1;
      int r = operations[i].upper;
      newArray[l] += newVal;
      newArray[r] -= newVal;
    }

    for(int i = 1; i < numElems; i++){
      newArray[i] += newArray[i-1];
    }

    for(int i = 0; i < numElems; i++){
      System.out.print(newArray[i]+array[i] + " ");
    }
    System.out.println();
  }

  static class Op {
    int lower;
    int upper;
    int val;

    Op(int lower, int upper, int value) {
        this.lower = lower;
        this.upper = upper;
        this.val = value;
    }
  }
}
