import sys

input = sys.stdin.readline

N, Q = map(int, input().split())
A = list(map(int, input().split()))


class Bit:
    """1-indexed"""

    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


bit = Bit(N + 1)
ans = [0] * N
for _ in range(Q):
    c, x, y = input().split()
    x, y = int(x), int(y)
    if c == 'A':
        n = bit.sum(x)
        ans[x - 1] += n * A[x - 1]
        bit.add(x, -n)
        bit.add(x + 1, n)
        A[x - 1] += y

    else:
        # assert c == 'B'
        bit.add(x, 1)
        bit.add(y + 1, -1)

for x in range(1, N + 1):
    n = bit.sum(x)
    ans[x - 1] += n * A[x - 1]
print(*ans)