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>
int main() {
  int n, m, k, i, j, x, y, l, r, d;
  int64_t atual;
  int64_t array[100000], soma[100000], somaQuery[100000];
  int operacoes[100000][3];
  scanf("%d %d %d", &n, &m, &k);
  for (i = 0; i < n; i++) {
    scanf("%" PRId64, &array[i]);
    soma[i] = 0;
    somaQuery[i] = 0;
  }
  for (i = 0; i < m; i++)
    scanf("%d %d %d", &operacoes[i][0], &operacoes[i][1], &operacoes[i][2]);
  for (i = 0; i < k; i++) {
    scanf("%d %d", &x, &y);
    somaQuery[x - 1] += 1;
    if (y < m) somaQuery[y] -= 1;
  }
  atual = 0;
  for (i = 0; i < m; i++) {
    atual += somaQuery[i];
    l = operacoes[i][0];
    r = operacoes[i][1];
    d = operacoes[i][2];
    soma[l - 1] += d * atual;
    if (r < n) soma[r] -= d * atual;
  }
  atual = 0;
  for (i = 0; i < n; i++) {
    atual += soma[i];
    array[i] += atual;
    printf("%" PRId64 " ", array[i]);
  }
  printf("\n");
}
