#define MOD_TYPE 1

#pragma region Macros

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

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename T>
using smaller_queue = priority_queue<T, vector<T>, greater<T>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

random_device seed_gen;
mt19937_64 engine(seed_gen());

// --------------------------------------

// 0-indexed
template <typename T>
struct BIT
{
  int n;
  vector<T> bit[2];
  BIT(int n) : n(n)
  {
    for (int p = 0; p < 2; p++)
      bit[p].assign(n, 0);
  }

  void add_sub(int p, int i, T x)
  {
    for (int idx = i; idx < n + 1; idx += (idx & -idx))
      bit[p][idx - 1] += x;
  }
  // [l,r) に加算
  void add(int l, int r, T x)
  {
    ++l, ++r;
    add_sub(0, l, -x * (l - 1));
    add_sub(0, r, x * (r - 1));
    add_sub(1, l, x);
    add_sub(1, r, -x);
  }
  T sum_sub(int p, int i)
  {
    T s(0);
    for (int idx = i; idx > 0; idx -= (idx & -idx))
      s += bit[p][idx - 1];
    return s;
  }
  T sum(int i)
  {
    ++i;
    return sum_sub(0, i) + sum_sub(1, i) * i;
  }
  // [l,r)
  T query(int l, int r) { return sum(r - 1) - sum(l - 1); }
  T get(int i) { return sum(i) - sum(i - 1); }
  void display()
  {
    rep(i, n) cerr << get(i) << " ";
    cerr << "\n";
  }
};

void solve()
{
  int n, q;
  cin >> n >> q;
  vector<tuple<char, ll, ll>> v;
  rep(i, n)
  {
    ll a;
    cin >> a;
    v.push_back({'A', i, a});
  }
  rep(i, q)
  {
    char c;
    ll x, y;
    cin >> c >> x >> y;
    x--;
    v.push_back({c, x, y});
  }
  reverse(all(v));
  vector<ll> ans(n);
  BIT<ll> bit(n);
  for (auto [type, x, y] : v)
  {
    if (type == 'A')
    {
      ans[x] += y * bit.get(x);
    }
    else
    {
      bit.add(x, y, 1);
    }
  }
  rep(i, n) cout << ans[i] << (i == n - 1 ? "\n" : " ");
}

int main()
{
  solve();
}