#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, int> pli;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

struct SegTree_dual{
    int sz = 1;
    vector<vector<int>> node;

    SegTree_dual(int sz_){
        while(sz < sz_) sz <<= 1;
        node.resize(sz << 1);
    }

    void update(int l, int r, int t){
        for(l+=sz, r+=sz; l<r; l>>=1, r>>=1){
            if(l&1){
                node[l].push_back(t);
                l++;
            }
            if(r&1){
                --r;
                node[r].push_back(t);
            }
        }
    }

    lint query(int i, lint a, vector<int> &b, vector<lint> &v){
        lint ret = 0;
        vector<int> cnt(b.size(), 0);

        i+=sz;
        ret += a * node[i].size();
        if(!b.empty()){
            for(int t: node[i]){
                int j = lower_bound(b.begin(), b.end(), t) - b.begin();
                ++cnt[0];
                if(j < cnt.size()) --cnt[j];
            }
        }
        i >>= 1;
        while(i){
            ret += a * node[i].size();
            if(!b.empty()) {
                for(int t: node[i]){
                    int j = lower_bound(b.begin(), b.end(), t) - b.begin();
                    ++cnt[0];
                    if(j < cnt.size()) --cnt[j];
                }
            }

            i>>=1;
        }

        partial_sum(cnt.begin(), cnt.end(), cnt.begin());
        rep(j, v.size()) ret += v[j] * cnt[j];
        return ret;
    }
};

int main(){
    int n, q;
    scanf("%d%d", &n, &q);
    lint a[n];
    rep(i, n) scanf("%lld", &a[i]);
    SegTree_dual st(n);
    vector<vector<int>> b(n, vector<int>(0));
    vector<vector<lint>> v(n, vector<lint>(0));

    rep(i, q){
        char c;
        int x;
        lint y;
        scanf(" %c%d%lld", &c, &x, &y);
        --x;
        if(c == 'A'){
            b[x].push_back(i);
            v[x].push_back(y);
        }
        else{
            st.update(x, y, i);
        }
    }

    rep(i, n) printf("%lld ", st.query(i, a[i], b[i], v[i]));
}