def aa(s,v):
    d=1
    while s<len(fen):
        if s&d:
            fen[s]+=v
            s+=d
        d<<=1
def bb(s):
    res,d=0,1
    while s:
        if s&d:
            res+=fen[s]
            s-=d
        d<<=1
    return res

n,q=map(int,input().split())
fen=[0]*(n+2)
ans=[0]*n
x=list(map(int,input().split()))
for i in range(q):
    a,b,c=input().split()
    b=int(b);c=int(c)
    if a=="A":
        x[b-1]+=c
        ans[b-1]-=bb(b)*c
    else:
        aa(b,1);aa(c+1,-1)
for i in range(n):
    ans[i]+=bb(i+1)*x[i]
print(" ".join(map(str,ans)))