#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define rep(i,a,b) for(int i =a; i <(b); ++i)

void solve(ll n, ll t, vector<char> &res) {
    fill(res.begin(), res.end(), '=');

    ll p, s, l;
    char d;
    cin >> p >> s >> d >> l;

    ll di = (d == 'L' ? -s : s);
    ll lf = p + di * t;
    ll rf = p + di * t + l - 1;

//    cout << lf << " " << rf << "\n";
    if (rf < 0 || lf >= n) {}
    else {
        lf = max(lf, 0ll);
        rf = min(rf, n-1);
        for (ll i = lf; i <= rf; i++) {
            res[i] = '#';
        }
        ll mot = (d == 'R' ? rf : lf);
        if (mot >= 0 && mot < n) {
            res[mot] = '!';
        }
    }

    for (auto x : res) cout << x;
    cout << "\n";
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    ll n, m, t;
    cin >> n >> m >> t;
    vector<char> res(n);

    while (m--) {
        solve(n, t, res);
    }
    return 0;
}