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

n, m, k = map(int, raw_input().split())

a = [0] + map(int, raw_input().split())

op = []

for i in xrange(m):
    op.append(map(int, raw_input().split()))

tsk = [0 for i in xrange(m+1)]

for i in xrange(k):

    rng = map(int, raw_input().split())
            
    if rng[1] < m:
        tsk[rng[1]] -= 1
    else:
        tsk[-1] += 1
        

    tsk[rng[0]-1] += 1


vec = [tsk[-1]]
for i in xrange(1, m):
    vec.append((-vec[i-1] + tsk[m-i])*-1)
    


vec.reverse()

diff = []
for i in xrange(1, n+1):
    diff.append(a[i]-a[i-1])
diff.append(a[n])


for i in xrange(m):
    
    soma = op[i][2] * vec[i]
            
    if op[i][1] < n:
        diff[op[i][1]] -= soma
    else:
        diff[-1] += soma        

    diff[op[i][0]-1] += soma



res = [diff[-1]]
for i in xrange(1, n):
    res.append((-res[i-1] + diff[n-i])*-1)

res.reverse()
print ' '.join(map(str, res))
