n, m ,t = map(int,input().split())
dm = {"R":1, "L":-1}
def is_ok(k):
    return 0 <=k and n > k

def get_cell(start: int, end: int, train: int, cell: int):
    if cell == train:
        return "!"
    elif start <= cell <= end:
        return "#"
    else:
        return "="

for _ in range(m):
    p, s, d, l = input().split()
    p = int(p)
    s = int(s)
    l = int(l)
    lokomotiva = p + s*t + l -1 if d=="R" else p-s*t
    d=dm[d]
    start = p+(s*t)*d
    end = p + (s*t)*d + l - 1
    print("".join(get_cell(start, end, lokomotiva, x) for x in range(n)))





"""    lokomotiva = p + d*s * t
    vagonek = lokomotiva + (l-1)*d*-1
    left = 0
    right = 0
    vagonek_count = 0

    if d == -1:
        left = min(n, max(0, lokomotiva))
        right = n -min(n, max(0, vagonek+1))
        vagonek_count = n - (left + right + is_ok(lokomotiva))
        res = left*"=" + "!" * is_ok(lokomotiva) + "#"*vagonek_count + "="*right


    else:
        left = min(n, max(0, vagonek+1))
        right = n - min(n, max(0, lokomotiva))
        vagonek_count = n - (left + right + is_ok(lokomotiva))
        res = left * "="+ "#" * vagonek_count   + "!" * is_ok(lokomotiva) + "=" * right
    print(left, vagonek_count, right, lokomotiva, vagonek)
    print(res)"""