#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);


// 区間加算　一点取得 RAQ 平方分割で実装
template <typename T>
struct RAQ{// 0-index
	int n,rn,bn; // rn個のかたまりをbn個
	vector<T> data,bucket;
	RAQ(int n_){init(n_);}
	void init(int n_){
		n = n_;
		rn = sqrt(n);
		bn = ceil((double)n/rn);
		data.resize(n,0);
		bucket.resize(bn,0);
	}
	T get(int i){
		return data[i]+bucket[i/rn];
	}
	void add(int s,int t,T x){ // s~tにxを加算
		for(int i=s;i<=t;++i){
			if(i%rn==0 && (i+rn-1)<=t){
				bucket[i/rn] += x;
				i += rn-1;
			}else{
				data[i] += x;
			}
		}
	}
};



int main(){
	ll N,Q;
	cin >> N >> Q;
	vector<ll> A(N),B(N,0);
	RAQ<ll> raq(N);
	FOR(i,0,N){
		cin >> A[i];
	}

	char c;
	ll x,y;
	FOR(q,0,Q){
		cin >> c >> x >> y;
		if(c=='A'){
			x--;
			ll a = raq.get(x);
			B[x] += A[x]*a;
			A[x] += y;
			raq.add(x,x,-a);
		}else{
			x--,y--;
			raq.add(x,y,1);
		}
	}
	FOR(i,0,N){
		B[i] += A[i]*raq.get(i);
	}
	cout << B[0];
	FOR(i,1,N){
		cout << " " << B[i];
	}
	cout << endl;
}