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

f = [0] * n


def ft_add(i: int, v: int) -> None:
    i += 1
    while i <= n:
        f[i - 1] += v
        i += i & -i


def ft_sum(i: int) -> int:
    s = 0
    while i:
        s += f[i - 1]
        i -= i & -i
    return s


qs: list[tuple[str, int, int]] = [("A", i, a[i]) for i in range(n)]
for _ in range(q):
    c, x_, y_ = input().split()
    qs.append((c, int(x_) - 1, int(y_)))

ans = [0] * n
for op, x, y in reversed(qs):
    if op == "A":
        ans[x] += ft_sum(x + 1) * y
    else:
        ft_add(x, +1)
        if y != n:
            ft_add(y, -1)
print(*ans)