//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N =2e5+10;

//head

int n, q;
int a[N];
ll b[N];
char c[N];
int x[N], y[N];

int bit[N];
void add(int i, int x) {
  while(i <= n) {
    bit[i] += x;
    i += i&-i;
  }
}
int sum(int i) {
  int res = 0;
  while(i) {
    res += bit[i];
    i &= i-1;
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> q;
  rep(i, n) cin >> a[i];
  rep(i, q) cin >> c[i] >> x[i] >> y[i];

  for(int i = q-1; i >= 0; i--) {
    if(c[i] == 'A') {
      b[x[i]-1] += ll(sum(x[i]))*y[i];
    }
    else {
      add(x[i], 1);
      add(y[i]+1, -1);
    }
  }
  rep(i, n) {
    b[i] += ll(sum(i+1))*a[i];
  }

  rep(i, n) cout << b[i] << (i == n-1?'\n':' ');
}