#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 200003
#define MOD 1000000007
#define INF 1000000000000000000

int n=1;
vector<int> tree;
void propagate(int i){
  if(i<n-1){
    tree[2*i+1]+=tree[i];
    tree[2*i+2]+=tree[i];
    tree[i]=0;
  }
}
void add(int a,int b,int i,int left,int right,int x){
  propagate(i);
  if(a<=left&&right<=b){
    tree[i]+=x;
    return;
  }
  if(b<=left||right<=a){
    return;
  }
  add(a,b,2*i+1,left,(left+right)/2,x);
  add(a,b,2*i+2,(left+right)/2,right,x);
}
int get(int i){
  int index=0;
  int left=0;
  int right=n;
  while(left+1<right){
    int x=(left+right)/2;
    propagate(index);
    if(i<x){
      right=x;
      index=2*index+1;
    }else{
      left=x;
      index=2*index+2;
    }
  }
  propagate(index);
  return tree[index];
}

int main(){
  int N,Q;
  cin>>N>>Q;
  vector<ll> A(N);
  vector<char> c(Q);
  vector<ll> x(Q),y(Q);
  for(int i=0;i<N;i++){
    cin>>A[i];
  }
  for(int i=0;i<Q;i++){
    cin>>c[i]>>x[i]>>y[i];
  }

  while(n<N){
    n<<=1;
  }
  tree.resize(2*n-1,0);
  vector<ll> B(N);
  for(int i=Q-1;i>=0;i--){
    if(c[i]=='B'){
      add(x[i]-1,y[i],0,0,n,1);
    }else{
      int cnt=get(x[i]-1);
      B[x[i]-1]+=(ll)cnt*y[i];
    }
  }

  for(int i=0;i<N;i++){
    int cnt=get(i);
    B[i]+=(ll)cnt*A[i];
  }

  for(int i=0;i<N;i++){
    cout<<B[i]<<" ";
  }
  cout<<endl;
}