#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define mod 1000000007
#define inf 1000000000
#define all(x) (x).begin(), (x).end()
#define pb push_back

const long double PI = acos(-1);

ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a / gcd(a,b) * b;}

int main(){
  ll n, q;
  cin >> n >> q;
  vector<ll> a(n);
  for(ll i = 0; i < n; i++) cin >> a[i];

  vector<ll> b(n, 0);
  for(ll i = 0; i < q; i++){
    char c;
    ll x, y;
    cin >> c >> x >> y;
    if(c == 'A'){
      a[x-1] += y;
    }else{
      for(ll j = x-1; j < y; j++){
        b[j] += a[j];
      }
    }
  } 

  for(ll i = 0; i < n; i++){
    cout << b[i] << (i<n-1?" ":"\n");
  }
  return 0;
}