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
#include <bits/stdc++.h>
using namespace std;
struct Operation {
  uint64_t l;
  uint64_t r;
  uint64_t d;
  int64_t count;
};
uint64_t* arr;
int64_t* ddArr;
struct Operation* operations;
int main() {
  uint64_t n, m, k;
  cin >> n;
  cin >> m;
  cin >> k;
  arr = new uint64_t[n];
  operations = new struct Operation[m];
  ddArr = new int64_t[n];
  for (uint64_t i = 0; i < n; i++) {
    cin >> arr[i];
    ddArr[i] = 0;
  }
  for (uint64_t i = 0; i < m; i++) {
    uint64_t l, r, d;
    cin >> l;
    cin >> r;
    cin >> d;
    l--;
    r--;
    operations[i] = {l, r, d, 0};
  }
  for (uint64_t i = 0; i < k; i++) {
    uint64_t l, r;
    cin >> l;
    cin >> r;
    l--;
    r--;
    operations[l].count++;
    if (r + 1 < m) operations[r + 1].count--;
  }
  uint64_t countTotal = 0;
  struct Operation current;
  for (uint64_t i = 0; i < m; i++) {
    current = operations[i];
    countTotal += current.count;
    ddArr[current.l] += current.d * countTotal;
    if (current.r + 1 < n) ddArr[current.r + 1] -= current.d * countTotal;
  }
  uint64_t arrTotal = 0;
  for (uint64_t i = 0; i < n; i++) {
    arrTotal += ddArr[i];
    int64_t tot = arr[i] + arrTotal;
    cout << tot << " ";
  }
}
