#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long

int N, Q;
int A[200010];
char c[200010];
int x[200010], y[200010];
int ans[200010];

struct lazysegtree {
    int size;
    vector<int> node, lazy;
    
    lazysegtree(int n) {
        size = 1;
        while (size<n) size *= 2;
        node.resize(2*size-1);
        lazy.resize(2*size-1);
    }
    
    void eval(int k) {
        node[k] += lazy[k];
        
        if (k<size-1) {
            lazy[2*k+1] += lazy[k];
            lazy[2*k+2] += lazy[k];
        }
        
        lazy[k] = 0;
    }
    
    void update(int a, int b, int x, int k, int l, int r) {
        eval(k);
        
        if (b<=l || r<=a) return;
        
        if (a<=l && r<=b) {
            lazy[k] += x;
            eval(k);
        }
        else {
            update(a, b, x, 2*k+1, l, (l+r)/2);
            update(a, b, x, 2*k+2, (l+r)/2, r);
            node[k] = min(node[2*k+1], node[2*k+2]);
        }
    }
    
    int query(int a, int b, int k, int l, int r) {
        eval(k);
        if (b<=l || r<=a) return 10000000;
        if (a<=l && r<=b) return node[k];
        int vl = query(a, b, 2*k+1, l, (l+r)/2);
        int vr = query(a, b, 2*k+2, (l+r)/2, r);
        
        return min(vl, vr);
    }
    
    void add(int a, int b, int x) {
        update(a, b, x, 0, 0, size);
    }
    
    int get(int a, int b) {
        return query(a, b, 0, 0, size);
    }
};
 
signed main() {
    cin.tie(0); ios::sync_with_stdio(false);
    cin >> N >> Q;
    rep(i, N) cin >> A[i];
    rep(i, Q) cin >> c[i] >> x[i] >> y[i];
    
    lazysegtree lst(N);
    for (int i=Q-1; i>=0; i--) {
        if (c[i]=='A') ans[x[i]-1] += y[i]*lst.get(x[i]-1, x[i]);
        else lst.add(x[i]-1, y[i], 1);
    }
    rep(i, N) ans[i] += A[i]*lst.get(i, i+1);
    
    rep(i, N) {
        if (i<N-1) cout << ans[i] << " ";
        else cout << ans[i] << endl;
    }
}