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;
const int mod = 7 + (int)1e9;
int n, m, k;
long long a[100001];
long long q[100001];
vector<long long> ops[100001];
long long starts[100001];
long long ends2[100001];
long long counts[100001];
map<pair<long long, long long>, long long> d;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) cin >> a[i + 1];
  long long x, y, dt;
  for (int i = 0; i < m; i++) {
    cin >> x >> y >> dt;
    ops[i + 1].push_back(x);
    ops[i + 1].push_back(y);
    ops[i + 1].push_back(dt);
  }
  for (int i = 0; i < m + 1; i++) starts[i] = 0;
  for (int i = 0; i < m + 1; i++) ends2[i] = 0;
  for (int i = 0; i < m + 1; i++) counts[i] = 0;
  for (int i = 0; i < k; i++) {
    cin >> x >> y;
    starts[x]++;
    ends2[y]++;
  }
  long long cur = 0;
  for (int i = 0; i < m + 1; i++) {
    cur += starts[i];
    counts[i] = cur;
    cur -= ends2[i];
  }
  for (int i = 0; i < m + 1; i++) {
    if (!ops[i].empty()) {
      ops[i][2] *= counts[i];
    }
  }
  for (int i = 0; i < n + 1; i++) starts[i] = 0;
  for (int i = 0; i < n + 1; i++) ends2[i] = 0;
  for (int i = 0; i < n + 1; i++) counts[i] = 0;
  for (int i = 0; i < m; i++) {
    vector<long long> temp = ops[i + 1];
    starts[temp[0]] += temp[2];
    ends2[temp[1]] += temp[2];
  }
  cur = 0;
  for (int ki = 0; ki < n; ki++) {
    int i = ki + 1;
    cur += starts[i];
    counts[i] = cur;
    cur -= ends2[i];
  }
  for (int i = 0; i < n; i++) {
    a[i + 1] += counts[i + 1];
  }
  for (int i = 0; i < n; i++) cout << a[i + 1] << " ";
  return 0;
}
