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
#!/usr/bin/env python
# -*- coding: UTF-8 -*-

import sys

MAXN = 100000

def ReadIn():
    data = [int(x) for x in sys.stdin.read().split()]
    offset = 0
    while offset < len(data):
        n, m, k = data[offset : offset + 3]
        offset += 3
        array = data[offset : offset + n]
        offset += n
        operations = [data[index : index + 3] for index in xrange(offset, offset + 3 * m, 3)]
        offset += 3 * m
        queries = [data[index : index + 2] for index in xrange(offset, offset + 2 * k, 2)]
        offset += 2 * k
        yield n, array, operations, queries

def Solve(n, array, operations, queries):
    cnt = [0] * (len(operations) + 2)
    for left, right in queries:
        cnt[left] += 1
        cnt[right + 1] -= 1
    for i in xrange(len(operations)):
        cnt[i + 1] += cnt[i]
        operations[i][2] *= cnt[i + 1]
    cnt = [0] * (len(array) + 2)
    for left, right, inc in operations:
        cnt[left] += inc
        cnt[right + 1] -= inc
    for i in xrange(len(array)):
        cnt[i + 1] += cnt[i]
        print array[i] + cnt[i + 1],
    print


if __name__ == '__main__':
    for n, array, operations, queries in ReadIn():
        Solve(n, array, operations, queries)
