import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int q = sc.nextInt();
        int[] org = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            org[i] = sc.nextInt();
        }
        boolean[] isA = new boolean[q];
        int[] lefts = new int[q];
        int[] rights = new int[q];
        for (int i = 0; i < q; i++) {
            isA[i] = sc.next().equals("A");
            lefts[i] = sc.nextInt();
            rights[i] = sc.nextInt();
        }
        BinaryIndexedTree bit = new BinaryIndexedTree(n + 2);
        long[] ans = new long[n + 1];
        for (int i = q - 1; i >= 0; i--) {
            if (isA[i]) {
                ans[lefts[i]] += (long)rights[i] * bit.getSum(lefts[i]);
            } else {
                bit.add(lefts[i], 1);
                bit.add(rights[i] + 1, -1);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 1; i <= n; i++) {
            if (i > 1) {
                sb.append(" ");
            }
            ans[i] += (long)org[i] * bit.getSum(i);
            sb.append(ans[i]);
        }
        System.out.println(sb);
    }
}
class BinaryIndexedTree {
    int size;
    int[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new int[size];
    }
    
    public void add(int idx, int value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public int getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public int getSum(int x) {
        int mask = 1;
        int ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}