#include <bits/stdc++.h>
using namespace std;

#define int long long

template< typename OperatorMonoid >
struct DuelSegmentTree {
  using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;

  int sz, height;
  vector< OperatorMonoid > lazy;
  const H h;
  const OperatorMonoid OM0;


  DuelSegmentTree(int n, const H h, const OperatorMonoid OM0)
      : h(h), OM0(OM0) {
    sz = 1;
    height = 0;
    while(sz < n) sz <<= 1, height++;
    lazy.assign(2 * sz, OM0);
  }

  inline void propagate(int k) {
    if(lazy[k] != OM0) {
      lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
      lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
      lazy[k] = OM0;
    }
  }

  inline void thrust(int k) {
    for(int i = height; i > 0; i--) propagate(k >> i);
  }

  void update(int a, int b, const OperatorMonoid &x) {
    thrust(a += sz);
    thrust(b += sz - 1);
    for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) lazy[l] = h(lazy[l], x), ++l;
      if(r & 1) --r, lazy[r] = h(lazy[r], x);
    }
  }

  OperatorMonoid operator[](int k) {
    thrust(k += sz);
    return lazy[k];
  }
};

signed main(){
	int n, q;
	cin >> n >> q;

	int a[200010];
	for(int i = 0;i < n;i++) cin >> a[i];

	DuelSegmentTree<int> seg(n, [](int a, int b){
		return a + b; 
	}, 0);

	int b[200010] = {};
	
	for(int i = 0;i < q;i++){
		char c;
		int x, y;
		cin >> c >> x >> y;
		x--;
		if(c == 'A'){
			b[x] += a[x] * seg[x];
			seg.update(x, x+1, -seg[x]);
			a[x] += y;
		}else{
			seg.update(x, y, 1);
		}
	}

	for(int i = 0;i < n;i++){
		b[i] += a[i] * seg[i];
		cout << b[i];
		if(i < n-1){
			cout << " ";
		}else{
			cout << endl;
		}
	}

	return 0;
}