#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w,
    x, y, z;
long long ans = 0, sum = 0, mn = 1e18, mx = 0, cnt = 0;
const long long M = 1000000007;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int main() {
  cin >> n >> m >> k;
  vector<long long> vec(n);
  vector<long long> zeros(n + 1);
  vector<long long> freq(m + 2);
  vector<pair<pair<int, int>, int>> ops;
  for (int i = 0; i < n; i++) cin >> vec[i];
  for (int i = 0; i < m; i++) {
    cin >> l >> r >> d;
    ops.push_back({{l, r}, d});
  }
  for (int i = 0; i < k; i++) {
    cin >> x >> y;
    freq[x] += 1;
    freq[y + 1] -= 1;
  }
  for (int i = 1; i <= m; i++) freq[i] += freq[i - 1];
  for (int i = 1; i <= m; i++) {
    zeros[ops[i - 1].first.first - 1] += (ops[i - 1].second * freq[i]);
    zeros[ops[i - 1].first.second] -= (ops[i - 1].second * freq[i]);
  }
  for (int i = 1; i < n; i++) zeros[i] += zeros[i - 1];
  for (int i = 0; i < n; i++) vec[i] += zeros[i];
  for (auto i : (vec)) cout << i << " ";
  cout << endl;
  return 0;
}

### Prompt

Please create a solution in Cpp to the following problem:

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;
long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w,
    x, y, z;
long long ans = 0, sum = 0, mn = 1e18, mx = 0, cnt = 0;
const long long M = 1000000007;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int main() {
  cin >> n >> m >> k;
  vector<long long> vec(n);
  vector<long long> zeros(n + 1);
  vector<long long> freq(m + 2);
  vector<pair<pair<int, int>, int>> ops;
  for (int i = 0; i < n; i++) cin >> vec[i];
  for (int i = 0; i < m; i++) {
    cin >> l >> r >> d;
    ops.push_back({{l, r}, d});
  }
  for (int i = 0; i < k; i++) {
    cin >> x >> y;
    freq[x] += 1;
    freq[y + 1] -= 1;
  }
  for (int i = 1; i <= m; i++) freq[i] += freq[i - 1];
  for (int i = 1; i <= m; i++) {
    zeros[ops[i - 1].first.first - 1] += (ops[i - 1].second * freq[i]);
    zeros[ops[i - 1].first.second] -= (ops[i - 1].second * freq[i]);
  }
  for (int i = 1; i < n; i++) zeros[i] += zeros[i - 1];
  for (int i = 0; i < n; i++) vec[i] += zeros[i];
  for (auto i : (vec)) cout << i << " ";
  cout << endl;
  return 0;
}

```