import sys
input = sys.stdin.readline

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)

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

    def get_size(self, x):
        x = self.find(x)
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x


N, Q = map(int, input().split())
A = list(map(int, input().split()))
query = []
for _ in range(Q):
    c, x, y = input().split()
    x, y = int(x), int(y)
    query.append((c, x, y))
    
query.reverse()
T = Fenwick_Tree(N + 1)
ans = [0] * N
for c, x, y in query:
    if c == "A":
        v = T.sum(0, x)
        ans[x - 1] += v * y
    else:
        T.add(x - 1, 1)
        T.add(y, -1)
        
for i in range(N):
    ans[i] += T.sum(0, i + 1) * A[i]
    
print(*ans)