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
# Enter your code here. Read input from STDIN. Print output to STDOUT
import sys
sys.setrecursionlimit(10**4)
import heapq


def update(values,updates):
    n=len(values)
    for b,e,v in updates:
        values[b-1]+=v
        if e<n:values[e]-=v
    for i in range(1,n):
        values[i]+=values[i-1]
    

def main():
    stdin=sys.stdin
    # stdin=open('input.txt','r')
    n,m,k=map(int,stdin.readline().strip().split())

    l=map(int,stdin.readline().strip().split())

    updates=[map(int,stdin.readline().strip().split()) for i in range(m)]

    queries=[map(int,stdin.readline().strip().split()) for i in range(k)]

    for q in queries:q.append(1)

    values=[0 for u in updates]

    update(values,queries)
    

    for i in range(len(values)):updates[i][-1]*=values[i]
    values=[0]*n
    update(values,updates)

    for i in xrange(n):
        print l[i]+values[i] ,
    print

main()