#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

struct LazySegmentTree {
private:
    int n;
    vector<ll> node, lazy;

public:
    LazySegmentTree(vector<ll> v) {
        int sz = (int)v.size();
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1);
        lazy.resize(2*n-1, 0);
        for(int i=0; i<sz; i++) node[i+n-1] = v[i];
        for(int i=n-2; i>=0; i--) node[i] = node[i*2+1] + node[i*2+2];
    }

    void eval(int k, int l, int r) {
        if(lazy[k] != 0) {
            node[k] += lazy[k];
            if(r - l > 1) {
                lazy[2*k+1] += lazy[k] / 2;
                lazy[2*k+2] += lazy[k] / 2;
            }
            lazy[k] = 0;
        }
    }

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

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

int main(int argc, char const *argv[]) {
  ll n, q;std::cin >> n >> q;
  LazySegmentTree seg(vll(n+1, 0));
  vvl d = VV(q, 2, 0, ll);
  vll A(n+1, 0);
  for(int i=1;i<=n;i++) std::cin >> A[i];
  for(int i=0;i<q;i++){
    char c;
    ll a, b;
    std::cin >> c >> a >> b;
    if(c=='A') d[i] = vll{a, b};
    else d[i] = vll{-a,-b};
  }
  vll B(n+1, 0);
  for(int i=q-1;i>=0;i--){
    if(d[i][0]>0){
      ll a = d[i][0], b = d[i][1];
      ll Q = seg.getsum(a, a+1);
      B[a] += b*Q;
    }else{
      ll a = -d[i][0], b = -d[i][1];
      seg.add(a, b+1, 1);
    }
  }
  for(int i=1;i<=n;i++){
    ll q = seg.getsum(i, i+1);
    B[i] += A[i] * q;
  }
  for(int i=1;i<=n;i++) std::cout << B[i] << (i==n?"\n":" ");
  return 0;
}