n, q = map(int, input().split())
A = list(map(int, input().split()))

bit = [0]*(n+1)

def bit_query(i):
    res = 0
    while i > 0:
        res += bit[i]
        i -= i & (-i)
    return res

def bit_update(i, x):
    while i <= n:
        bit[i] += x
        i += i & (-i)

L = [0]*q
for i in range(q):
    query = list(map(str, input().split()))
    L[i] = query
L.reverse()

B = [0]*n
for i in range(q):
    c, x, y = L[i]
    if c == 'B':
        x = int(x)
        y = int(y)
        bit_update(x, 1)
        bit_update(y+1, -1)
    else:
        x = int(x)-1
        y = int(y)
        B[x] += y*bit_query(x+1)
for i in range(n):
    B[i] += A[i]*bit_query(i+1)
print(*B)