using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Runtime.CompilerServices; using System.Text; using System.Diagnostics; using System.Numerics; using static Template; using static System.Console; using static System.Convert; using static System.Math; using Pi = Pair; class Solver { public void Solve(Scanner sc) { int N, Q; sc.Make(out N, out Q); var h = new List

(); for(int i = 0; i < N; i++) { var a = sc.Next(); h.Add(new P('A', i+1, a)); } for (int i = 0; i < Q; i++) h.Add(new P(sc.Next(), sc.Next(), sc.Next())); h.Reverse(); var ct = new DualSegmentTree(N, 0, (a, b) => a + b); var res = new long[N]; foreach(var p in h) { if (p.c == 'B') { ct.Update(p.x-1, p.y, 1);continue; } var c = ct.Query(p.x - 1); res[p.x - 1] += p.y * c; } Console.WriteLine(string.Join(" ", res)); } struct P { public char c;public int x, y;public P(char C,int X,int Y) { c = C;x = X;y = Y; } } } public class DualSegmentTree { protected readonly T[] data; protected readonly int size; protected readonly Func merge; protected readonly T idT; [MethodImpl(MethodImplOptions.AggressiveInlining)] protected int Parent(int i) => (i - 1) >> 1; [MethodImpl(MethodImplOptions.AggressiveInlining)] protected int Left(int i) => (i << 1) + 1; [MethodImpl(MethodImplOptions.AggressiveInlining)] protected int Right(int i) => (i + 1) << 1; public T this[int i] { get { return data[i + size - 1]; } set { data[i + size - 1] = value; } } public DualSegmentTree(int N, T idT, Func merge) { this.merge = merge; this.size = 1; this.idT = idT; while (size < N) size <<= 1; data = new T[2 * this.size - 1]; for (var i = 0; i < 2 * size - 1; i++) data[i] = idT; } public void Update(int left, int right, T value, int k = 0, int l = 0, int r = -1) { if (r == -1) r = size; if (r <= left || right <= l) return; if (left <= l && r <= right) data[k] = merge(data[k], value); else { Update(left, right, value, Left(k), l, (l + r) >> 1); Update(left, right, value, Right(k), (l + r) >> 1, r); } } public T Query(int i) { i += size - 1; var value = merge(idT, data[i]); while (i > 0) { i = Parent(i); value = merge(value, data[i]); } return value; } public int Find(int st, Func check) { var x = idT; return Find(st, check, ref x, 0, 0, size); } private int Find(int st, Func check, ref T x, int k, int l, int r) { if (l + 1 == r) { x = merge(x, data[k]); return check(x) ? k - size + 1 : -1; } var m = (l + r) >> 1; if (m <= st) return Find(st, check, ref x, Right(k), m, r); if (st <= l && !check(merge(x, data[k]))) { x = merge(x, data[k]); return -1; } var xl = Find(st, check, ref x, Left(k), l, m); if (xl >= 0) return xl; return Find(st, check, ref x, Right(k), m, r); } } #region Template public static class Template { static void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver().Solve(new Scanner()); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmin(ref T a, T b) where T : IComparable { if (a.CompareTo(b) == 1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmax(ref T a, T b) where T : IComparable { if (a.CompareTo(b) == -1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void swap(ref T a, ref T b) { var t = b; b = a; a = t; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create(int n, Func f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create(int n, Func f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; } public static void Fail(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); } } public class Scanner { public string Str => Console.ReadLine().Trim(); public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray(); public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray(); public char[][] Grid(int n) => Create(n, () => Str.ToCharArray()); public int[] ArrInt1D(int n) => Create(n, () => Int); public long[] ArrLong1D(int n) => Create(n, () => Long); public int[][] ArrInt2D(int n) => Create(n, () => ArrInt); public long[][] ArrLong2D(int n) => Create(n, () => ArrLong); private Queue q = new Queue(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public T Next() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); } public void Make(out T1 v1) => v1 = Next(); public void Make(out T1 v1, out T2 v2) { v1 = Next(); v2 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next(); } public void Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next(); } //public (T1, T2) Make() { Make(out T1 v1, out T2 v2); return (v1, v2); } //public (T1, T2, T3) Make() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); } //public (T1, T2, T3, T4) Make() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); } } public class Pair : IComparable> { public T1 v1; public T2 v2; public Pair() { } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair p) { var c = Comparer.Default.Compare(v1, p.v1); if (c == 0) c = Comparer.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; } } public class Pair : Pair, IComparable> { public T3 v3; public Pair() : base() { } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair p) { var c = base.CompareTo(p); if (c == 0) c = Comparer.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; } } #endregion