import typing


class FenwickTree:
    '''Reference: https://en.wikipedia.org/wiki/Fenwick_tree'''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.data = [0] * n

    def add(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        return self._sum(right) - self._sum(left)

    def _sum(self, r: int) -> typing.Any:
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r

        return s

from itertools import accumulate
N,Q = map(int,input().split())
A = list(map(int,input().split()))
CXY = [input().split() for _ in range(Q)]

ft = FenwickTree(N+1)
B = [0] * N
C = [0] * (N + 1)
for c,x,y in CXY:
    if c == "B":
        x, y = int(x), int(y)
        C[x - 1] += 1
        C[y] -= 1
C = list(accumulate(C))

for c,x,y in CXY:
    x, y = int(x), int(y)
    if c == "B":
        ft.add(x-1,1)
        ft.add(y,-1)
    else:
        B[x-1] += y * (C[x-1] - ft.sum(0,x))

for i in range(N):
    B[i] += A[i] * ft.sum(0,i + 1)
print(*B)