#define _USE_MATH_DEFINES #include using namespace std; //template #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(a);i>(b);i--) #define ALL(v) (v).begin(),(v).end() typedef long long int ll; const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12; void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;} template inline bool chmax(T& a,T b){ if(a inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; } //template end template struct LazySegmentTree{ using F=function; using G=function; using H=function; int sz,height; vector data; vector lazy; const F f;const G g; const H h; const M m1; const N n1; LazySegmentTree(int n,const F f,const G g,const H h,const M &m1,const N n1):f(f),g(g),h(h),m1(m1),n1(n1){ sz=1,height=0; while(sz v){ rep(i,0,v.size())data[i+sz]=v[i]; rrep(k,sz-1,0)data[k]=f(data[2*k],data[2*k+1]); } M ref(int k){return lazy[k]==n1?data[k]:g(data[k],lazy[k]);} void recalc(int k){while(k>>=1)data[k]=f(ref(2*k),ref(2*k+1));} void thrust(int k){rrep(i,height,0)eval(k>>i);} void eval(int k){ if(lazy[k]!=n1){ lazy[2*k]=h(lazy[2*k],lazy[k]); lazy[2*k+1]=h(lazy[2*k+1],lazy[k]); data[k]=ref(k); lazy[k]=n1; } } void update(int a,int b,N x){ thrust(a+=sz); thrust(b+=sz-1); for(int l=a,r=b+1;l>=1,r>>=1){ if(l&1)lazy[l]=h(lazy[l],x),++l; if(r&1)--r,lazy[r]=h(lazy[r],x); } recalc(a); recalc(b); } M query(int a,int b){ thrust(a+=sz); thrust(b+=sz-1); M L=m1,R=m1; for(int l=a,r=b+1;l>=1,r>>=1){ if(l&1)L=f(L,ref(l++)); if(r&1)R=f(ref(--r),R); } return f(L,R); } }; struct query{ char c; int x,y; }; int main(){ int n,q; scanf("%d%d",&n,&q); vector a(n); rep(i,0,n)scanf("%d",&a[i]); vector b(q); rep(i,0,q){ char c; int x,y; cin>>c>>x>>y; b.push_back(query{c,x,y}); } reverse(ALL(b)); LazySegmentTree seg(n, [](ll a,ll b){return a+b;}, [](ll a,ll b){return a+b;}, [](ll a,ll b){return a+b;},0,0); vector res(n,0); rep(i,0,q){ if(b[i].c=='A'){ ll add=seg.query(b[i].x-1,b[i].x); res[b[i].x-1]+=b[i].y*add; } else seg.update(b[i].x-1,b[i].y,1); } rep(i,0,n)res[i]+=seg.query(i,i+1)*a[i]; rep(i,0,n)printf("%d ",res[i]); puts(""); return 0; }