// team mo[d|k]re tricko

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

int main() {
    int n, m, t;
    scanf("%d %d %d", &n, &m, &t);

    for (int i = 0; i < m; ++i) {
        int p, s, l;
        char d;
        scanf("%d %d %c %d", &p, &s, &d, &l);

        int start = p + (d == 'R' ? 1 : -1) * (t * s);
        int end = (p + l - 1) + (d == 'R' ? 1 : -1) * (t * s);


        for (int j = 0; j < n; ++j) {
            if (j >= start && j <= end) {
                if ((j == start && d == 'L') || j == end && d == 'R') {
                    printf("!");
                } else {
                    printf("#");
                }
            } else {
                printf("=");
            }
        }

        printf("\n");



    }

    return 0;
}