#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long;
#define int ll

int n, m, t;
constexpr int MAXN = 100'000;
int p[MAXN], s[MAXN], l[MAXN];
char d[MAXN];

signed main() {
    cin >> n >> m >> t;
    for (int i = 0; i < m; i++) {
        cin >> p[i] >> s[i] >> d[i] >> l[i];
    }
    for (int tt = 0; tt < m; tt++) {
        int dd = (d[tt] == 'L' ? -1 : 1);
        int ff = (dd == -1 ? p[tt] : p[tt] + l[tt] - 1);
        ff += dd * s[tt] * t;
        int bb = ff - dd * l[tt];
        for (int i = 0; i < n; i++)  {
            if (i == ff) {
                cout << '!';
            } else if (i < max(bb, ff) && i > min(bb, ff)) {
                cout << "#";
            } else {
                cout << "=";
            }
        }
        cout << endl;
    }
}