#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, m;
    cin >> n >> m;
    int f[n+1][n+1];
    rep(i,n+1)rep(j,n+1)f[i][j] = 1;
    f[0][0] = 0;
    int x = 0, y = 0;
    string s;
    cin >> s;
    rep(i,m){
        if(s[i] == 'U') y++;
        if(s[i] == 'R') x++;
        if(s[i] == 'L') x--;
        if(s[i] == 'D') y--;
        f[x][y] = 0;
    }
    drep(j,n+1){
        rep(i,n+1){
            cout << f[i][j];
            if(i == n) cout << endl;
            else cout << ' ';
        }
    }
    return 0;
}