def main():
    import sys
    input = sys.stdin.readline

    class Bit:
        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

    N, Q = map(int, input().split())
    A = list(map(int, input().split()))
    query = [None] * Q
    for i in range(Q):
        query[Q-i-1] = tuple(input().split())

    bit = Bit(N+3)
    ans = [0] * (N+1)
    for flg, x, y in query:
        x = int(x)
        y = int(y)
        if flg == 'B':
            bit.add(x, 1)
            bit.add(y+1, -1)
        else:
            ans[x] += y * bit.sum(x)
    for x in range(1, N+1):
        ans[x] += A[x-1] * bit.sum(x)
    print(*ans[1:])




if __name__ == '__main__':
    main()