#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

template <typename T>
ostream& operator<< (ostream& os, const vector<T> & v) {
    os << "[ ";
    for (const T & elem : v) {
        os < elem << " ";
    }
    os << " ]";
    return os;
}

void test_case(ll n, ll m, ll t) {
    ll p, s, l;
    char d;
    cin >> p >> s >> d >> l;

    if (d == 'R')
        p += s * t;
    else
        p -= s * t;
    
    ll engine_pos;
    if (d == 'R')
        engine_pos = p + l - 1;
    else
        engine_pos = p;
    
    ll first_car_pos, last_car_pos;
    if (d == 'R') {
        first_car_pos = p;
        last_car_pos = engine_pos - 1;
    } else {
        first_car_pos = engine_pos + 1;
        last_car_pos = p + l - 1;
    }

    for (ll i = 0; i < n; ++i) {
        if (i == engine_pos) {
            cout << "!";
        } else if (i >= first_car_pos && i <= last_car_pos) {
            cout << "#";
        } else {
            cout << "=";
        }
    }
    cout << endl;
}

int main() {
    cin.tie(0);
    cout.tie(0);
    cin.exceptions(ios::failbit);
    ios::sync_with_stdio(false);
    ll n, m, t;
    cin >> n >> m >> t; // potential comment
    for (ll i = 0; i < m; ++i) {
        test_case(n, m, t);
    }
    return 0;
}