//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
////////////////////////////
// 区間加算区間和
struct RSQRAQ {
    ll n;
    vector<ll> dat, lazy;
    RSQRAQ(){}
    RSQRAQ(ll n_) {
        n = 1; while(n < n_) n *= 2;
        dat.assign(n*2, 0);
        lazy.assign(n*2, 0);
    }
    void eval(ll len, ll k) {
        if(lazy[k] == 0) return;
        if(k*2+1 < n*2-1) {
            lazy[2*k+1] += lazy[k];
            lazy[2*k+2] += lazy[k];
        }
        dat[k] += lazy[k]*len;
        lazy[k] = 0;
    }
    // [a, b)にxを加える
    ll update(ll a, ll b, ll x, ll k, ll l, ll r) {
        eval(r-l, k);
        if(b <= l || r <= a) return dat[k];
        if(a <= l && r <= b) {
            lazy[k] += x;
            return dat[k] + lazy[k]*(r-l);
        }
        return dat[k] = update(a, b, x, 2*k+1, l, (l+r)/2) + update(a, b, x, 2*k+2, (l+r)/2, r);
    }
    ll update(ll a, ll b, ll x) { return update(a, b, x, 0, 0, n); }
    // [a, b)の和を求める
    ll query(ll a, ll b, ll k, ll l, ll r) {
        eval(r-l, k);
        if(b <= l || r <= a) return 0;
        if(a <= l && r <= b) return dat[k];
        ll vl = query(a, b, 2*k+1, l, (l+r)/2);
        ll vr = query(a, b, 2*k+2, (l+r)/2, r);
        return vl + vr;
    }
    ll query(ll a, ll b) { return query(a, b, 0, 0, n); }
};
//セグ木なので番号は0~n-1
/////////////////////////////////////////


int main(){fastio
    ll n,q;cin>>n>>q;
    ll a[n+1];rep(i,1,n)cin>>a[i];
    ll z[q],x[q],y[q];
    rep(i,0,q-1){
        string s;cin>>s;
        if(s[0]=='A')z[i]=0;
        else z[i]=1;
        cin>>x[i]>>y[i];
    }
    
    ll ans[n+1];
    ll imos[n+2];memset(imos,0,sizeof(imos));
    rep(i,0,q-1){
        if(z[i]==1){
            imos[x[i]]++;
            imos[y[i]+1]--;
        }
    }
    rep(i,0,n)imos[i+1]+=imos[i];
    rep(i,1,n)ans[i]=imos[i]*a[i];
    //rep(i,1,n)cout<<ans[i]<<" ";cout<<endl;
    
    RSQRAQ u(n+2);
    for(ll i=q-1;i>=0;i--){
        if(z[i]==0){
            ll kai=u.query(x[i],x[i]+1);
            ans[x[i]]+=kai*y[i];
        }else{
            u.update(x[i],y[i]+1,1);
        }
    }
    rep(i,1,n)cout<<ans[i]<<" ";
    
    return 0;
}