#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

const int N = 2e5 + 5;

ll a1[N];
ll a2[N];

void m1(int l, int r, int tp) {
    a1[l] += tp;
    a1[r + 1] -= tp;
}

void m2(int l, int r, int tp) {
    int k1 = (l + r) / 2;
    int k2 = (l + r + 1) / 2;
    a2[l] += tp;
    a2[k1 + 1] -= tp;
    a2[k2 + 1] -= tp;
    a2[r + 2] += tp;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, q;
    cin >> n >> q;
    while (q--) {
        char c;
        int l, r;
        cin >> c >> l >> r;
        if (c == 'R') m1(l, r, 1);
        else if (c == 'D') m1(l, r, -1);
        else if (c == 'H') m2(l, r, 1);
        else if (c == 'V') m2(l, r, -1);
        else assert(0);
    }
    for (int i = 1; i <= n; i++)
        a1[i] += a1[i - 1];
    ll cur = 0, slp = 0;
    for (int i = 1; i <= n; i++) {
        slp += a2[i];
        cur += slp;
        a1[i] += cur;
    }
    for (int i = 1; i <= n; i++)
        cout << a1[i] << " \n"[i == n];
}