#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  long long a[n + 1];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  vector<long long> op_c;
  op_c.assign(m + 2, 0);
  vector<vector<long long>> op(m + 1);
  for (long long i = 1; i <= m; i++) {
    op[i].resize(3);
    cin >> op[i][0] >> op[i][1] >> op[i][2];
  }
  long long x, y;
  for (long long i = 1; i <= k; i++) {
    cin >> x >> y;
    op_c[x]++;
    op_c[y + 1]--;
  }
  vector<long long> adder;
  adder.assign(n + 2, 0);
  for (long long i = 1; i <= m; i++) {
    op_c[i] += op_c[i - 1];
    op[i][2] *= op_c[i];
    adder[op[i][0]] += op[i][2];
    adder[op[i][1] + 1] -= op[i][2];
  }
  for (long long i = 1; i <= n; i++) {
    adder[i] += adder[i - 1];
    a[i] += adder[i];
  }
  for (long long i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
}

### Prompt

Develop a solution in CPP to the problem described below:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  long long a[n + 1];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  vector<long long> op_c;
  op_c.assign(m + 2, 0);
  vector<vector<long long>> op(m + 1);
  for (long long i = 1; i <= m; i++) {
    op[i].resize(3);
    cin >> op[i][0] >> op[i][1] >> op[i][2];
  }
  long long x, y;
  for (long long i = 1; i <= k; i++) {
    cin >> x >> y;
    op_c[x]++;
    op_c[y + 1]--;
  }
  vector<long long> adder;
  adder.assign(n + 2, 0);
  for (long long i = 1; i <= m; i++) {
    op_c[i] += op_c[i - 1];
    op[i][2] *= op_c[i];
    adder[op[i][0]] += op[i][2];
    adder[op[i][1] + 1] -= op[i][2];
  }
  for (long long i = 1; i <= n; i++) {
    adder[i] += adder[i - 1];
    a[i] += adder[i];
  }
  for (long long i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
}

```