#include <iostream>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

//区間加算、1点クエリ
const int DEPTH = 18;
struct SegTree {
	int val[1 << (DEPTH + 1)];
	SegTree() {
		int i;
		rep(i, (1 << (DEPTH + 1))) val[i] = 0;
	}
	void add(int l, int r, int x, int a = 0, int b = (1 << DEPTH), int id = 0) {
		if (a >= r || b <= l) return;
		if (l <= a && b <= r) { val[id] += x; return; }
		add(l, r, x, a, (a + b) / 2, id * 2 + 1);
		add(l, r, x, (a + b) / 2, b, id * 2 + 2);
	}
	int get(int pos) {
		pos += (1 << DEPTH) - 1;
		int ret = val[pos];
		while (pos > 0) {
			pos = (pos - 1) / 2;
			ret += val[pos];
		}
		return ret;
	}
};

int n, q;
int a[200000];
char c[200000]; int x[200000], y[200000];
SegTree seg;
int B[200000];

signed main() {
	int i;
	
	cin >> n >> q;
	rep(i, n) cin >> a[i];
	rep(i, q) {
		cin >> c[i] >> x[i] >> y[i];
		x[i]--;
	}
	
	rep(i, q) {
		if (c[i] == 'B') {
			seg.add(x[i], y[i], 1);	//[x, y)
		}
	}
	
	rep(i, n) {
		B[i] = seg.get(i) * a[i];
	}
	
	rep(i, q) {
		if (c[i] == 'A') {
			B[x[i]] += seg.get(x[i]) * y[i];
		}
		else {
			seg.add(x[i], y[i], -1);
		}
	}
	
	rep(i, n) {
		cout << B[i];
		if (i + 1 < n) cout << " ";
	}
	cout << endl;
	return 0;
}