#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	int N, Q, q;;
	vector<int> A, B, con;
	vector<pair<int,int>> p;
	
	cin>>N>>Q;
	
	A.resize(N);
	B.resize(N);
	con.resize(N+1);
	
	q = 1 + (int)sqrt(Q);
	
	for(int i = 0; i < N; i++){
		cin>>A[i];
	}
	
	for(int i = 0, b = 0; i < Q; i++){
		char c;
		int x, y;
		
		cin>>c>>x>>y;
		
		
		if(c == 'A') {
			
			x--;
			p.push_back({x, y});
			
		} else {
			x--;
			y--;
			
			con[x]++;
			con[y+1]--;
			
			for(int j = 0; j < p.size(); j++){
				if(x <= p[j].first && p[j].first  <= y) {
					B[p[j].first] += p[j].second;
				}
			}
		}
		
		if(i%q == 0 || i + 1 == Q) {
			for(int i = 0; i < N; i++){
				con[i+1] += con[i];
			}
			
			for(int i = 0; i < N; i++){
				B[i] += A[i] * con[i];
				con[i] = 0;
			}
			con[N] = 0;
			
			for(int j = 0; j < p.size(); j++){
				A[p[j].first] += p[j].second;
			}
			p.clear();
		}
	}
	
	for(int i = 0; i < N; i++){
		if(i) cout<<" ";
		cout<<B[i];
	}
	cout<<endl;
	
	return 0;
}