#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
class LazySegmentTree{
public:
    int n;
    vector<ll> node, lazy;

    LazySegmentTree(vector<ll> v){
        int sz = v.size();
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
        lazy.resize(2*n-1, 0);
        for(int i=0; i<sz; i++) node[i+n-1] = v[i];
        for(int i=n-2; i>=0; i--) node[i] = node[2*i+1] + node[2*i+2];
    }

    void eval(int k, int l, int r){
        if(lazy[k] != 0){
            node[k] += lazy[k];

            if(r - l > 1){
                lazy[2*k+1] += lazy[k] / 2;
                lazy[2*k+2] += lazy[k] / 2;
            }

            lazy[k] = 0;
        }
    }

    void add(int a, int b, ll x, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;

        eval(k, l, r);

        if(b <= l || r <= a) return ;

        if(a <= l && r <= b){
            lazy[k] += (r - l) * x;
            eval(k, l, r);
        }
        else{
            add(a, b, x, 2*k+1, l, (l+r)/2);
            add(a, b, x, 2*k+2, (l+r)/2, r);
            node[k] = node[2*k+1] + node[2*k+2];
        }
    }

    ll getsum(int a, int b, int k=0, int l=0, int r=-1){
        if(r < 0) r = n;
        if(b <= l || r <= a) return 0;

        eval(k, l, r);
        if(a <= l && r <= b) return node[k];
        ll vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        ll vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return vl + vr;
    }
};
int main(){
   int n,q;cin >> n >> q;
   vector<ll> a(n);
   for(int i=0;i<n;i++){
       cin >> a[i];
   }
   LazySegmentTree seg(vector<ll>(n,0));
   vector<ll> b(n);
   vector<char> c(q);
   vector<int> x(q),y(q);
   for(int i=0;i<q;i++){
       cin >> c[i] >> x[i] >> y[i];
       if(c[i]=='B'){
           y[i]--;
       }
       x[i]--;
   }
   for(int i=q-1;i>=0;i--){
       if(c[i]=='A'){
           b[x[i]]+=seg.getsum(x[i],x[i]+1)*y[i];
       }
       else{
           seg.add(x[i],y[i]+1,1);
       }
   }
   for(int i=0;i<n;i++){
       b[i]+=seg.getsum(i,i+1)*a[i];
   }
   for(int i=0;i<n;i++){
       cout << b[i] << " ";
   }
   cout << endl;
}