Greg has an array *a* = *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> and *m* operations. Each operation looks as: *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub>, *d*<sub class="lower-index">*i*</sub>, (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ *n*). To apply operation *i* to the array means to increase all array elements with numbers *l*<sub class="lower-index">*i*</sub>, *l*<sub class="lower-index">*i*</sub> + 1, ..., *r*<sub class="lower-index">*i*</sub> by value *d*<sub class="lower-index">*i*</sub>.

Greg wrote down *k* queries on a piece of paper. Each query has the following form: *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>, (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ *y*<sub class="lower-index">*i*</sub> ≤ *m*). That means that one should apply operations with numbers *x*<sub class="lower-index">*i*</sub>, *x*<sub class="lower-index">*i*</sub> + 1, ..., *y*<sub class="lower-index">*i*</sub> to the array.

Now Greg is wondering, what the array *a* will be after all the queries are executed. Help Greg.
The first line contains integers *n*, *m*, *k* (1 ≤ *n*, *m*, *k* ≤ 10<sup class="upper-index">5</sup>). The second line contains *n* integers: *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (0 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>) — the initial array.

Next *m* lines contain operations, the operation number *i* is written as three integers: *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub>, *d*<sub class="lower-index">*i*</sub>, (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ *n*), (0 ≤ *d*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>).

Next *k* lines contain the queries, the query number *i* is written as two integers: *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>, (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ *y*<sub class="lower-index">*i*</sub> ≤ *m*).

The numbers in the lines are separated by single spaces.

n, m, k = map(int, input().split())
helperArray = [0 for i in range(n)]
currentArray = []
currentInput = input().split()
for num in currentInput:
    currentArray.append(int(num))


helperArrayTwo = [0 for i in range(m)]
queries = []
for i in range(m):
    leftBound, rightBound, value = map(int, input().split())
    queries.append((leftBound, rightBound, value))

for i in range(k):
    leftBound, rightBound = map(int, input().split())
    leftBound -= 1
    rightBound -= 1
    helperArrayTwo[leftBound] += 1
    if rightBound + 1 < len(helperArrayTwo):
        helperArrayTwo[rightBound + 1] -= 1

# print(helperArrayTwo)
for i in range(m):
    if i - 1 >= 0:
        helperArrayTwo[i] += helperArrayTwo[i - 1]
    leftBound, rightBound, value = queries[i]
    leftBound -= 1
    rightBound -= 1
    helperArray[leftBound] += (helperArrayTwo[i] * value)
    if rightBound + 1 < len(helperArray):
        helperArray[rightBound + 1] -= (helperArrayTwo[i] * value)

for i in range(len(currentArray)):
    if i - 1 >= 0:
        helperArray[i] += helperArray[i - 1]
    currentArray[i] += helperArray[i]

for num in currentArray:
    print(num, end=" ")
