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 MAXN = 100010;
long long c[MAXN];
int n;
int lowbit(int x) { return x & (-x); }
void add(int i, long long val) {
  while (i <= n) {
    c[i] += val;
    i += lowbit(i);
  }
}
long long query(int i) {
  long long s = 0;
  while (i > 0) {
    s += c[i];
    i -= lowbit(i);
  }
  return s;
}
int c2[MAXN];
int m;
void add2(int i, int val) {
  while (i <= m) {
    c2[i] += val;
    i += lowbit(i);
  }
}
int query2(int i) {
  int s = 0;
  while (i > 0) {
    s += c2[i];
    i -= lowbit(i);
  }
  return s;
}
int a[MAXN];
struct Node {
  int u, v, w;
} node[MAXN];
int main() {
  int k;
  int u, v, w;
  while (scanf("%d%d%d", &n, &m, &k) == 3) {
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    memset(c, 0, sizeof(c));
    memset(c2, 0, sizeof(c2));
    for (int i = 1; i <= m; i++) {
      scanf("%d%d%d", &u, &v, &w);
      node[i].u = u;
      node[i].v = v;
      node[i].w = w;
    }
    while (k--) {
      scanf("%d%d", &u, &v);
      add2(u, 1);
      add2(v + 1, -1);
    }
    for (int i = 1; i <= m; i++) {
      long long t = query2(i);
      t *= node[i].w;
      add(node[i].u, t);
      add(node[i].v + 1, -t);
    }
    for (int i = 1; i <= n; i++) {
      printf("%I64d", query(i) + a[i]);
      if (i == n)
        printf("\n");
      else
        printf(" ");
    }
  }
  return 0;
}
