#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
//const ll mod = 1000000007;
ll N, Q;
ll A[200000];
ll B[200000];
char c[200000];
ll x[200000], y[200000];
struct SegmentTree {
private:
    int n;
    vector<int> node;
 
public:
    SegmentTree() {
        int sz = 200001;
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
        for(int i=0; i<sz; i++) node[i+n-1] = 0;
        for(int i=n-2; i>=0; i--) node[i] = min(node[2*i+1], node[2*i+2]);
    }
 
    void add(int x, int val) {
        x += (n - 1);
        node[x] += val;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = (node[2*x+1] + node[2*x+2]);
        }
    }
    // hannkaikukann 
    int getsum(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return node[k];
 
        int vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        int vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return (vl + vr);
    }
};


int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> Q;
    for(int i = 0; i < N; i++) cin >> A[i];
    for(int i = 0; i < Q; i++) {
        cin >> c[i] >> x[i] >> y[i];
    }
    SegmentTree seg;
    for(int i = Q - 1; i >= 0; i--) {
        if(c[i] == 'A') {
            x[i]--;
            ll num = seg.getsum(0, x[i] + 1);
            B[x[i]] += num * y[i];
        } else {
            x[i]--;
            y[i]--;
            seg.add(x[i], 1);
            seg.add(y[i]+1, -1);
        }
    }
    for(int i = 0; i < N; i++) {
        ll num = seg.getsum(0, i + 1);
        B[i] += num * A[i];
    }
    for(int i = 0; i < N; i++) {
        if(i != 0) cout << " ";
        cout << B[i];
    }
    cout << endl;
    return 0;
}