#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define For(i, a, n) for(ll i=a;i<n;i++)
#define vec vector
#define sz(x) (ll)x.size()
#define all(x) begin(x), end(x)


template<typename... Args>
void dbg(Args&&... args){
    ((cerr<<args<<" |"),...);
    cerr<<endl;
}

void solve(){
    ll n, m, t; cin>>n>>m>>t;
    For(i, 0, m){
        vec<char> ans(n, '=');
        ll p, s, l; char d;
        cin>>p>>s>>d>>l;
        ll fp = p + t*s*(d=='R'?1:-1);
        ll lp = fp + l;
        // dbg(fp, lp, p, s, t);
        For(j, max(0ll, fp), min(n, lp)){
            ans[j] = '#';
        }
        if(d == 'R'){
            if(lp<=n && lp>0)ans[lp-1]='!';
        }else if(fp>=0 && fp<n)ans[fp]='!';
        for(auto c:ans)cout<<c;
        cout<<"\n";
    }
}

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

    ll t = 1;//cin>>t;
    while(t--)solve();
}