#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()

template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
  return std::vector<T>(n, std::forward<T>(val));
}

template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}

#include <vector>
using i64 = long long;

template<class T, class Ope, const T& Ide>
struct segment_tree {
  Ope ope;
 
  i64 n;
  std::vector<T> node;
 
  segment_tree(const std::vector<T>& init) {
    n = 1;
    while(n < init.size()) n *= 2;
    node.resize(2 * n, Ide);
    for(int i = 0;i < init.size();i++) node[i + n] = init[i];
    for(int i = n - 1; i >= 1;i--) node[i] = ope(node[i * 2], node[i * 2 + 1]);
  }
 
  void modify(i64 i, T x) {
    i += n;
    node[i] = ope(node[i], x);
    while(i > 1) {
      i = i / 2;
      node[i] = ope(node[i * 2], node[i * 2 + 1]);
    }
  }

  /* [l, r) */
  T sum(i64 l, i64 r) const {
    T lx = Ide;
    T rx = Ide;
    l += n;
    r += n;
    while(l < r) {
      if(l & 1) { lx = ope(lx, node[l++]); }
      if(r & 1) { rx = ope(node[--r], rx); }
      l >>= 1;
      r >>= 1;
    }
    return ope(lx, rx);
  }
};

const i64 IDE = 0;
using segtree = segment_tree<i64, std::plus<i64>, IDE>;

int main() {
  i64 N, Q;
  cin >> N >> Q;
  vector<i64> A(N);
  rep(i,0,N) {
    cin >> A[i];
  }
  vector<char> C(Q);
  vector<i64> X(Q), Y(Q);
  rep(i,0,Q) {
    cin >> C[i] >> X[i] >> Y[i];
  }
  segtree seg(vector<i64>(N + 1));
  vector<i64> B(N);
  for(i64 q = Q; q --> 0;) {
    char c = C[q];
    i64 x = X[q] - 1;
    i64 y = Y[q];
    if(c == 'B') {
      seg.modify(x, 1);
      seg.modify(y, -1);
    }
    else {
      B[x] += seg.sum(0, x + 1) * y;
    }
  }
  for(i64 i = 0;i < N;i++) {
    B[i] += seg.sum(0, i + 1) * A[i];
  }
  for(i64 i = 0;i < N;i++) {
    cout << B[i] << " \n"[i + 1 == N];
  }
}