#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n, m;
    string s;
    cin >> n >> m >> s;
    vector<vector<bool>> mat(n + 1, vector<bool>(n + 1));
    int32_t x = 0, y = 0;
    mat[0][0] = true;
    for (auto c : s) {
        if (c == 'U')
            ++y;
        else if (c == 'R')
            ++x;
        else if (c == 'L')
            --x;
        else
            --y;
        mat[x][y] = true;
    }
    for (auto yi = n; yi >= 0; --yi) {
        for (auto xi = 0; xi <= n; ++xi) {
            cout << !mat[xi][yi] << (xi == n ? '\n' : ' ');
        }
    }
    return 0;
}