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 {
  int left, right, value;
};
int main() {
  int no_of_elements, no_of_operations, no_of_queries;
  scanf("%d %d %d", &no_of_elements, &no_of_operations, &no_of_queries);
  vector<long long> element(no_of_elements + 1, 0);
  for (int i = 1; i <= no_of_elements; i++) cin >> element[i];
  vector<operation> operations(no_of_operations + 1);
  for (int i = 1; i <= no_of_operations; i++)
    scanf("%d %d %d", &operations[i].left, &operations[i].right,
          &operations[i].value);
  vector<int> no_of_operations_starting(no_of_operations + 2, 0);
  while (no_of_queries--) {
    int left_operation, right_operation;
    scanf("%d %d", &left_operation, &right_operation);
    no_of_operations_starting[left_operation]++;
    no_of_operations_starting[right_operation + 1]--;
  }
  vector<int> no_of_uses(no_of_operations + 1, 0);
  for (int i = 1; i <= no_of_operations; i++)
    no_of_uses[i] = no_of_uses[i - 1] + no_of_operations_starting[i];
  vector<long long> no_of_updates_starting(no_of_elements + 2, 0);
  for (int i = 1; i <= no_of_operations; i++) {
    int start_point = operations[i].left, end_point = operations[i].right,
        d = operations[i].value;
    no_of_updates_starting[start_point] += no_of_uses[i] * 1LL * d;
    no_of_updates_starting[end_point + 1] -= no_of_uses[i] * 1LL * d;
  }
  vector<long long> amount_to_be_added(no_of_elements + 1, 0);
  for (int i = 1; i <= no_of_elements; i++)
    amount_to_be_added[i] =
        amount_to_be_added[i - 1] + no_of_updates_starting[i];
  for (int i = 1; i <= no_of_elements; i++) element[i] += amount_to_be_added[i];
  for (int i = 1; i <= no_of_elements; i++) cout << element[i] << " ";
  cout << endl;
  return 0;
}
