#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

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

    def find_kth_element(self, k):
        data = self.data; size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


N, Q = map(int, readline().split())
A = [0] + list(map(int, readline().split()))
B = [0] * (N + 1)
add_count = BinaryIndexedTree([0] * (N + 10))
for _ in range(Q):
    c, x, y = readline().split()
    x = int(x)
    y = int(y)
    if c == b'A':
        A[x] += y
        B[x] -= y * add_count.get_sum(x)
    else:
        add_count.add(x, 1)
        add_count.add(y + 1, -1)

C = add_count.data
for i in range(1, N + 10):
    j = i - (i & -i)
    C[i] += C[j]

answer = (c * a + b for a, b, c in zip(A[1:], B[1:], C[1:]))
print(' '.join(map(str, answer)))