#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


template<typename T>
struct BIT{
  Int n;
  vector<T> bit;
  //1-indexed
  BIT(Int n_):n(n_+1),bit(n+1,0){}

  T sum(Int i){
    T s(0);
    for(Int x=i;x>0;x-=(x&-x))
      s+=bit[x];
    return s;
  }

  void add(Int i,T a){
    if(i==0) return;
    for(Int x=i;x<=n;x+=(x&-x))
      bit[x]+=a;
  }

  Int lower_bound(Int w){
    if(w<=0) return 0;
    Int x=0,r=1;
    while(r<n) r<<=1;
    for(Int k=r;k>0;k>>=1){
      if(x+k<=n&&bit[x+k]<w){
        w-=bit[x+k];
        x+=k;
      }
    }
    return x+1;
  }

  // [l, r)
  T query(Int l,Int r){
    return sum(r-1)-sum(l-1);
  }

  T sum0(Int i){
    return sum(i+1);
  }

  void add0(Int i,T a){
    add(i+1,a);
  }

  T query0(Int l,Int r){
    return sum(r)-sum(l);
  }
};

//INSERT ABOVE HERE
signed main(){
  Int n,q;
  cin>>n>>q;
  vector<Int> as(n);
  for(Int i=0;i<n;i++) cin>>as[i];

  vector<char> cs(q);
  vector<Int> xs(q),ys(q);
  for(Int i=0;i<q;i++) cin>>cs[i]>>xs[i]>>ys[i];

  vector<Int> bs(n);

  BIT<Int> bit(n+10);
  for(Int i=q-1;i>=0;i--){
    xs[i]--;
    if(cs[i]=='A'){
      bs[xs[i]]+=ys[i]*bit.sum0(xs[i]);
    }
    if(cs[i]=='B'){
      bit.add0(xs[i],+1);
      bit.add0(ys[i],-1);
    }
  }
  for(Int i=0;i<n;i++){
    if(i) cout<<" ";
    bs[i]+=as[i]*bit.sum0(i);
    cout<<bs[i];
  }
  cout<<endl;
  return 0;
}