#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

const std::string dir = "LRDU";
const std::vector<int> dx{-1, 1, 0, 0}, dy{0, 0, -1, 1};

void solve() {
    int n, m;
    std::string s;
    std::cin >> n >> m >> s;

    auto ans = vec(n + 1, vec(n + 1, true));
    ans[0][0] = false;

    int x = 0, y = 0;
    for (char c : s) {
        int i = 0;
        while (dir[i] != c) ++i;

        x += dx[i], y += dy[i];

        if (0 <= x && x <= n && 0 <= y && y <= n) {
            ans[y][x] = false;
        }
    }

    std::reverse(ans.begin(), ans.end());
    for (const auto& v : ans) {
        for (const auto& b : v) {
            std::cout << b << " ";
        }
        std::cout << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}