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;
bool cmp(pair<long long int, char> p1, pair<long long int, char> p2) {
  return p1.first > p2.first;
}
vector<long long int> a, cumm1, cumm2;
vector<vector<long long int> > q;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m, k, i;
  cin >> n >> m >> k;
  a.resize(n + 2);
  q.resize(m + 2);
  cumm1.resize(n + 2, 0);
  cumm2.resize(m + 2, 0);
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 1; i <= m; i++) {
    q[i].resize(3);
    cin >> q[i][0] >> q[i][1] >> q[i][2];
  }
  for (i = 0; i < k; i++) {
    long long int x, y;
    cin >> x >> y;
    cumm2[x]++;
    cumm2[y + 1]--;
  }
  for (i = 1; i <= m; i++) {
    cumm2[i] += cumm2[i - 1];
  }
  for (i = 1; i <= m; i++) {
    cumm1[q[i][0]] += cumm2[i] * q[i][2];
    cumm1[q[i][1] + 1] -= cumm2[i] * q[i][2];
  }
  for (i = 1; i <= n; i++) cumm1[i] += cumm1[i - 1];
  for (i = 1; i <= n; i++) cout << a[i] + cumm1[i] << " ";
  cout << "\n";
}
