#include #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= (n); ++i) #define rrep(i, n) for (ll i = (n - 1); i >= 0; --i) #define ALL(obj) (obj).begin(), (obj).end() #define pb push_back #define to_s to_string #define len(v) (int)v.size() #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define print(x) cout << (x) << '\n' #define debug(x) cout << #x << ": " << (x) << '\n' using namespace std; using ll = long long; typedef pair P; ll MOD = 1e9 + 7; ll devc(ll x, ll y) { return 1 + (x - 1) / y; } template struct fenwick_tree { int n; std::vector x; fenwick_tree(int n_ = 0) : n(n_), x(n + 1, 0) {} int size() const { return n; } T sum(int r) const { T S = 0; for (r = r - 1; r >= 0; r = (r & (r + 1)) - 1) S += x[r]; return S; } T sum(int l, int r) const { return sum(r) - sum(l); } void add(int k, const T &a) { for (; k < n; k |= k + 1) x[k] += a; } void set(int k, const T &a) { add(k, a - sum(k, k + 1)); } }; template struct fenwick_tree_range { fenwick_tree a, b; fenwick_tree_range(int n = 0) : a(n), b(n) {} int size() const { return a.size(); } T sum(int r) const { return a.sum(r) + b.sum(r) * r; } T sum(int l, int r) const { return sum(r) - sum(l); } void add(int r, const T &x) { a.add(r, x * r); b.add(r, -x); } void add(int l, int r, const T &x) { add(l, -x); add(r, x); } }; int main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20); ll N, Q; cin >> N >> Q; vector A(N); fenwick_tree B(N); rep(i, N) cin >> A[i]; rep(i, Q){ char c; ll x, y; cin >> c >> x >> y; --x; if(c == 'A') A[x] += y; else{ --y; for (ll j = x; j <= y; ++j){ B.add(j, A[j]); } } } rep(i,N){ ll x = B.sum(i, i + 1); cout << x << " "; } return 0; }