#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

//1-indexed
template <typename T>
struct bit{
    int n;
    vector<T> data;

    bit(int n_){
        n = 1;
        while(n < n_) n *= 2;
        data = vector<T>(n+1);
        for(int i = 0; i <= n; i++) data[i] = 0;
    }
    
    T sum(int i){
        T ret = 0;
        while(i > 0){
            ret += data[i];
            i -= i&-i;
        }
        return ret;
    }

    void add(int i, T x){
        while(i <= n){
            data[i] += x;
            i += i&-i;
        }
    }
};

int N, Q;
ll A[200000];
ll ans[200000];
ll imos[200005];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> Q;
    for(int i = 0; i < N; i++) cin >> A[i];
    bit<int> btl(N), btr(N);
    int cnt_a = 0;
    
    for(int i = 0; i < Q; i++){
        char c; int x, y; cin >> c >> x >> y;
        if(c == 'B'){
            btl.add(x, 1);
            btr.add(y, 1);
            cnt_a++;
            imos[x-1]++;
            imos[y]--;
        }else{
            ll cnt_r = btr.sum(x-1);
            ll cnt_l = (y == N ? 0 : btl.sum(N)-btl.sum(x));
            ans[x-1] -= (y)*(cnt_a-cnt_l-cnt_r);
            A[x-1] += y;
        }
    }
    for(int i = 1; i < N; i++) imos[i] += imos[i-1];
    for(int i = 0; i < N; i++){
        ans[i] += imos[i]*A[i];
        cout << ans[i] << ' ';
    }
    cout << endl;
}