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

class segtree {
    vector<int64_t> v;
    int s;
    
    void set_inner(int x, int y, int index, int l, int r) {
        if (r <= x || y <= l) return;
        if (x <= l && r <= y) {
            v.at(index)++;
            return;
        }
        set_inner(x, y, 2 * index + 1, l, (l + r) / 2);
        set_inner(x, y, 2 * index + 2, (l + r) / 2, r);
    }
    
public:
    segtree(int n) {
        s = 1;
        while (s < n) s *= 2;
        for (int i = 0; i < 2 * s - 1; i++) {
            v.push_back(0);
        }
    }
    
    int64_t get(int x) {
        int c = x + s - 1;
        int64_t ans = 0;
        for (;;) {
            ans += v.at(c);
            if (c == 0) break;
            c = (c - 1) / 2;
        }
        return ans;
    }
    
    void set(int x, int y) {
        set_inner(x, y, 0, 0, s);
    }
    
    void print() {
        for (int i = 0; i < 2 * s - 1; i++) {
            cerr << v.at(i) << endl;
        }
    }
};

struct query {
    char c;
    int64_t x, y;
};

int main() {
    int n, q;
    cin >> n >> q;
    vector<int64_t> a(n);
    for (int i = 0; i < n; i++) cin >> a.at(i);
    vector<query> v(q);
    for (int i = 0; i < q; i++) cin >> v.at(i).c >> v.at(i).x >> v.at(i).y;
    reverse(v.begin(), v.end());
    vector<int64_t> b(n);
    segtree s(n);
    for (auto t : v) {
        t.x--;
        if (t.c == 'A') {
            b.at(t.x) += s.get(t.x) * t.y;
        } else {
            s.set(t.x, t.y);
        }
    }
    for (int i = 0; i < n; i++) {
        b.at(i) += s.get(i) * a.at(i);
    }
    for (int i = 0; i < n; i++) {
        cout << b.at(i);
        if (i < n - 1) {
            cout << " ";
        } else {
            cout << endl;
        }
    }
}