#include <bits/stdc++.h>
using namespace std;
using lint     = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;

template <typename T = lint>
struct SegmentTreeLazyAdd {
  private:
    using F = function<T(T, T)>;
    using G = function<int(int, int)>;
    int n;
    vector<T> node, lazy, width;
    vector<bool> lazyFlag;
    F func;
    G funcw;
    T unit;

  public:
    SegmentTreeLazyAdd(int sz, F func, G funcw, T unit) : func(func), funcw(funcw), unit(unit) {
        n = 1;
        while (n < sz)
            n *= 2;
        node.assign(2 * n - 1, unit);
        lazy.assign(2 * n - 1, 0);
        lazyFlag.assign(2 * n - 1, false);
        width.assign(2 * n - 1, 1);
        for (int i = n - 2; i >= 0; --i) {
            width[i] = funcw(width[i * 2 + 1], width[i * 2 + 2]);
        }
    }
    SegmentTreeLazyAdd(vector<T> v, F func, G funcw, T unit) : func(func), funcw(funcw), unit(unit) {
        int sz = int(v.size());
        n      = 1;
        while (n < sz)
            n *= 2;
        node.assign(2 * n - 1, unit);
        lazy.assign(2 * n - 1, 0);
        lazyFlag.assign(2 * n - 1, false);
        for (int i = 0; i < sz; i++)
            node[i + n - 1] = v[i];
        for (int i = n - 2; i >= 0; i--)
            node[i] = func(node[i * 2 + 1], node[i * 2 + 2]);
        width.assign(2 * n - 1, 1);
        for (int i = n - 2; i >= 0; --i) {
            width[i] = funcw(width[i * 2 + 1], width[i * 2 + 2]);
        }
    }
    void lazyEvaluate(int k, int l, int r) {
        if (lazyFlag[k]) {
            node[k] += lazy[k] * width[k];
            if (r - l > 1) {
                lazy[k * 2 + 1] += lazy[k];
                lazy[k * 2 + 2] += lazy[k];
                lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
            }
            lazyFlag[k] = false;
            lazy[k]     = 0;
        }
    }
    // add x to nodes in [a, b)
    void add(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
        if (r < 0)
            r = n;
        lazyEvaluate(k, l, r);
        if (b <= l || r <= a) {
            return;
        }
        if (a <= l && r <= b) {
            lazy[k] += x; // +=
            lazyFlag[k] = true;
            lazyEvaluate(k, l, r);
            return;
        } else {
            const int mid = (l + r) / 2;
            add(a, b, x, k * 2 + 1, l, mid);
            add(a, b, x, k * 2 + 2, mid, r);
            node[k] = func(node[2 * k + 1], node[2 * k + 2]);
        }
    }
    // get func() in [a, b)
    T query(int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)
            r = n;
        lazyEvaluate(k, l, r);
        if (b <= l || r <= a)
            return unit;
        if (a <= l && r <= b)
            return node[k];
        T vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
        T vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
        return func(vl, vr);
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<lint> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<char> c(q);
    vector<int> x(q), y(q);
    for (int i = 0; i < q; ++i) {
        cin >> c[i] >> x[i] >> y[i];
        x[i]--;
        if (c[i] == 'B')
            y[i]--;
    }
    vector<lint> b(n, 0);
    auto f = [](lint l, lint r) { return l + r; };
    auto g = [](int l, int r) { return l + r; };
    SegmentTreeLazyAdd<lint> seg(n, f, g, 0);

    for (int i = q - 1; i >= 0; --i) {
        if (c[i] == 'A') {
            lint cnt = seg.query(x[i], x[i] + 1);
            b[x[i]] += cnt * y[i];
        } else if (c[i] == 'B') {
            seg.add(x[i], y[i] + 1, 1);
        }
    }
    for (int i = 0; i < n; ++i) {
        lint cnt = seg.query(i, i + 1);
        b[i] += a[i] * cnt;
    }
    for (int i = 0; i < n; ++i) {
        if (i != 0)
            cout << " ";
        cout << b[i];
    }
    cout << endl;
    return 0;
}