#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

bool used[222][222];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    used[0][0]=1;
    int x=0,y=0;
    string s; cin >> s;
    for(int i=0;i<m;i++){
        if(s[i]=='U')x++;
        if(s[i]=='D')x--;
        if(s[i]=='R')y++;
        if(s[i]=='L')y--;
        if(0<=x&&x<=n&&0<=y&&y<=n){
            used[x][y]=1;
        }
    }
    for(int i=n;i>=0;i--){
        for(int j=0;j<=n;j++){
            printf("%d ",(used[i][j])^1 );
        }
        printf("\n");
    }
}