#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    vector<vector<ll>> ans(n + 1, vector<ll>(n + 1, 1));
    ans[0][0] = 0;
    ll x = 0, y = 0;
    rep(i, m) {
        if (s[i] == 'U') y++;
        if (s[i] == 'D') y--;
        if (s[i] == 'R') x++;
        if (s[i] == 'L') x--;
        ans[y][x] = max(0LL, ans[y][x] - 1);
    }
    rrep(y, n + 1) {
        rep(x, n + 1) {
            printf("%lld%s", ans[y][x], (x == n) ? "\n" : " ");
        }
    }
    return 0;
}