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 N = 100100;
long long s[N];
long long p[N];
struct node {
  int l, r, d;
} t[N];
int main() {
  int n, m, k;
  while (EOF != scanf("%d%d%d", &n, &m, &k)) {
    for (int i = 1; i <= n; i++) scanf("%I64d", &s[i]);
    for (int i = 1; i <= m; i++) scanf("%d%d%d", &t[i].l, &t[i].r, &t[i].d);
    int x, y;
    for (int i = n; i > 1; i--) s[i] -= s[i - 1];
    memset(p, 0, sizeof(p));
    int max = 0;
    while (k--) {
      scanf("%d%d", &x, &y);
      p[x]++;
      p[y + 1]--;
      if (y > max) max = y;
    }
    for (int i = 2; i <= max + 2; i++) p[i] += p[i - 1];
    for (int i = 1; i <= max; i++) {
      if (p[i] == 0) continue;
      s[t[i].l] += t[i].d * p[i];
      s[t[i].r + 1] -= t[i].d * p[i];
    }
    cout << s[1];
    for (int i = 2; i <= n; i++) {
      s[i] += s[i - 1];
      printf(" %I64d", s[i]);
    }
    printf("\n");
  }
  return 0;
}
