#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using pi = pair <int, int>;

void solve ()
{
    ll n, m, t;
    cin >> n >> m >> t;
    struct train
    {
        ll p, s, l;
        char d;
    };
    vector<train> trs(m);
    for (auto& x : trs)
        cin >> x.p >> x.s >> x.d >> x.l;

    for (auto x : trs)
    {
        string line(n, '=');
        if (x.d == 'R')
        {
            ll q = x.p + x.s * t;
            for (ll i = min(n, max(0LL, q)); i < min(n, max(0LL, q + x.l)); ++i)
            {
                line[i] = '#';
            }
            if (q + x.l - 1 >= 0 && q + x.l - 1 < n)
                line[q + x.l - 1] = '!';
        }
        else
        {
            ll q = x.p - x.s * t;
            for (ll i = min(n, max(0LL, q)); i < min(n, max(0LL, q + x.l)); ++i)
            {
                line[i] = '#';
            }
            if (q >= 0 && q < n)
                line[q] = '!';
        }
        cout << line << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    solve();
    return 0;
}