#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

template <typename T> 
struct LazySegmentTree {
  
  int n;
  vector<T> node, lazy;

  LazySegmentTree (int sz, T init = 0) {
    n = 1; while (n < sz) n <<= 1;
    node.assign(2*n, init);
    lazy.assign(2*n, 0); /*区間加算の時は0*/
  }

  void eval (int k) {
    if (lazy[k] == 0) return ;
    node[k] += lazy[k]; /*区間加算に注意*/
    if (k < n) {
      lazy[2*k+1] += lazy[k];
      lazy[2*k+2] += lazy[k];
    }
    lazy[k] = 0;
  }

  void update(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
    eval(k);
    if (r < 0) r = n;
    if (b <= l || r <= a) return ;
    if (a <= l && r <= b) {
      lazy[k] = x;
      eval(k);
    } else {
      update(a, b, x, 2*k+1, l, (r+l)/2);
      update(a, b, x, 2*k+2, (r+l)/2, r);
      node[k] = node[2*k+1] + node[2*k+2];
    }
  }

  T query(int a, int b, int k = 0, int l = 0, int r = -1) {
    eval(k);
    if (r < 0) r = n;
    if (r <= a || b <= l) return 0;
    if (a <= l && r <= b) return node[k];
    T vl = query(a, b, 2*k+1, l, (l+r)/2);
    T vr = query(a, b, 2*k+2, (l+r)/2, r);
    return vl + vr;
  }

};

int main(){
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  rep(i,n) cin >> a[i];

  LazySegmentTree<int> seg(n);
  vector<pair<char, P>> query(q);

  rep(i,q) {
    char c;
    int x, y;
    cin >> c >> x >> y;
    x--;
    query[i].first = c;
    query[i].second.first = x;
    query[i].second.second = y;
  }

  reverse(query.begin(), query.end());
  vector<ll> res(n,0);

  for (int i = 0; i < q; i++) {
    char c = query[i].first;
    int x = query[i].second.first, y = query[i].second.second;
    if (c == 'A') { 
      res[x] += (ll)seg.query(x, x + 1) * y;
    } else {
      seg.update(x, y, 1);
    }
  }
  for (int i = 0; i < n; i++) {
    res[i] += (ll)a[i] * seg.query(i, i + 1);
  }
  for (int i = 0; i < n; i++) cout << res[i] << " ";
  cout << endl;
  return 0;
}