#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, k;
  scanf("%lld", &n), scanf("%lld", &m), scanf("%lld", &k);
  long long a[100000 + 1000];
  long long tmp[100100], tmp1[100100];
  memset(tmp, 0, sizeof tmp);
  memset(tmp1, 0, sizeof tmp1);
  vector<pair<pair<long long, long long>, long long> > pp;
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  long long b, c, d;
  for (long long i = 1; i <= m; i++) {
    scanf("%lld", &b), scanf("%lld", &c), scanf("%lld", &d);
    pp.push_back(make_pair(make_pair(b, c), d));
  }
  long long x, y;
  for (long long i = 1; i <= k; i++) {
    scanf("%lld", &x), scanf("%lld", &y);
    tmp[x]++;
    tmp[y + 1]--;
  }
  for (long long i = 2; i <= m; i++) {
    tmp[i] += tmp[i - 1];
  }
  for (long long i = 1; i <= m; i++) {
    tmp1[pp[i - 1].first.first] += (pp[i - 1].second * tmp[i]);
    tmp1[pp[i - 1].first.second + 1] -= (pp[i - 1].second * tmp[i]);
  }
  cout << a[1] + tmp1[1] << " ";
  for (long long i = 2; i <= n; i++) {
    tmp1[i] += tmp1[i - 1];
    cout << tmp1[i] + a[i] << " ";
  }
  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;
int main() {
  long long n, m, k;
  scanf("%lld", &n), scanf("%lld", &m), scanf("%lld", &k);
  long long a[100000 + 1000];
  long long tmp[100100], tmp1[100100];
  memset(tmp, 0, sizeof tmp);
  memset(tmp1, 0, sizeof tmp1);
  vector<pair<pair<long long, long long>, long long> > pp;
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  long long b, c, d;
  for (long long i = 1; i <= m; i++) {
    scanf("%lld", &b), scanf("%lld", &c), scanf("%lld", &d);
    pp.push_back(make_pair(make_pair(b, c), d));
  }
  long long x, y;
  for (long long i = 1; i <= k; i++) {
    scanf("%lld", &x), scanf("%lld", &y);
    tmp[x]++;
    tmp[y + 1]--;
  }
  for (long long i = 2; i <= m; i++) {
    tmp[i] += tmp[i - 1];
  }
  for (long long i = 1; i <= m; i++) {
    tmp1[pp[i - 1].first.first] += (pp[i - 1].second * tmp[i]);
    tmp1[pp[i - 1].first.second + 1] -= (pp[i - 1].second * tmp[i]);
  }
  cout << a[1] + tmp1[1] << " ";
  for (long long i = 2; i <= n; i++) {
    tmp1[i] += tmp1[i - 1];
    cout << tmp1[i] + a[i] << " ";
  }
  return 0;
}

```