#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

template<class T>
struct BIT {
  vector<T> dat;

  BIT(int n) : dat(n + 1) {}

  void update(int k, T v) {
    for (int i = k + 1; i < dat.size(); i += i & -i) {
      dat[i] += v;
    }
  }

  T query(int k) {
    T res = 0;
    for (int i = k + 1; i > 0; i -= i & -i) {
      res += dat[i];
    }
    return res;
  }
};

int main() {
  int N, Q;
  cin >> N >> Q;
  vector<ll> A(N); rep(i, N) cin >> A[i];
  BIT<ll> bit(N + 1);
  vector<char> C(Q);
  vector<int> X(Q), Y(Q);
  rep(i, Q) {
    cin >> C[i] >> X[i] >> Y[i];
    X[i]--;
  }
  vector<ll> ans(N);
  repr(i, Q) {
    if (C[i] == 'A') {
      ans[X[i]] += bit.query(X[i]) * Y[i];
    } else {
      bit.update(X[i], 1);
      bit.update(Y[i], -1);
    }
  }
  rep(i, N) {
    ans[i] += bit.query(i) * A[i];
  }
  rep(i, N) cout << ans[i] << " \n"[i == N - 1];
}