#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  ll n, q;
  cin >> n >> q;
  vector<ll> a(n);
  REP(i, n) { cin >> a[i]; }
  vector<ll> cnt(n + 1, 0), b(n, 0);
  while (q--) {
    string s;
    ll x, y;
    cin >> s >> x >> y;
    if (s == "A") {
      REP(i, n) {
        cnt[i + 1] += cnt[i];
        b[i] += cnt[i] * a[i];
      }
      REP(i, n) { cnt[i] = 0; }
      x--;
      a[x] += y;
    } else {
      x--;
      cnt[x]++;
      cnt[y]--;
    }
  }

  REP(i, n) {
    cnt[i + 1] += cnt[i];
    b[i] += cnt[i] * a[i];
  }

  REP(i, n) { cout << b[i] << " \n"[i == n - 1]; }
}