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;
typedef struct Operacao {
  int32_t inicio, fim;
  int64_t valor;
} op_t;
void prefix_sum(int64_t *lista, const int32_t inicio, const int32_t fim,
                const int64_t valor) {
  lista[inicio] += valor;
  lista[fim + 1] -= valor;
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int32_t tamanho, qtde_operacoes, qtde_consultas, i, inicio, fim;
  cin >> tamanho >> qtde_operacoes >> qtde_consultas;
  int64_t prefix_array[tamanho + 1], op_prefix_array[qtde_operacoes + 1], valor;
  op_t operacoes[qtde_operacoes];
  int32_t anterior = 0;
  for (i = 0; i < tamanho; i++) {
    cin >> valor;
    prefix_array[i] = valor - anterior;
    anterior = valor;
  }
  for (i = 0; i < qtde_operacoes; i++) {
    cin >> operacoes[i].inicio >> operacoes[i].fim >> operacoes[i].valor;
    op_prefix_array[i] = 0;
  }
  for (i = 0; i < qtde_consultas; i++) {
    cin >> inicio >> fim;
    prefix_sum(op_prefix_array, inicio - 1, fim - 1, 1);
  }
  valor = 0;
  for (i = 0; i < qtde_operacoes; i++) {
    valor += op_prefix_array[i];
    prefix_sum(prefix_array, operacoes[i].inicio - 1, operacoes[i].fim - 1,
               operacoes[i].valor * valor);
  }
  valor = 0;
  for (i = 0; i < tamanho - 1; i++) {
    valor += prefix_array[i];
    cout << valor << " ";
  }
  valor += prefix_array[i];
  cout << valor << "\n";
  return 0;
}
