#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int N;
int M;
char S[1000000+2];
int mp[202][202];
int x;
int y;
int main(){
  int i;
  rd(N);N += (1);
  rd(M);
  rd(S);
  for(i=(0);i<(N);i++){
    int j;
    for(j=(0);j<(N);j++){
      mp[i][j] = 1;
    }
  }
  x = N-1;
  y = 0;
  mp[x][y] = 0;
  for(i=(0);i<(M);i++){
    if(S[i]=='R'){
      y++;
    }
    if(S[i]=='L'){
      y--;
    }
    if(S[i]=='U'){
      x--;
    }
    if(S[i]=='D'){
      x++;
    }
    mp[x][y] = 0;
  }
  {
    int FmcKpFmN;
    int xr20shxY;
    for(FmcKpFmN=(0);FmcKpFmN<(N);FmcKpFmN++){
      if(N==0){
        wt_L('\n');
      }
      else{
        for(xr20shxY=(0);xr20shxY<(N-1);xr20shxY++){
          wt_L(mp[FmcKpFmN][xr20shxY]);
          wt_L(' ');
        }
        wt_L(mp[FmcKpFmN][xr20shxY]);
        wt_L('\n');
      }
    }
  }
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int N, M;
// char S[1d6+2];
// int mp[202][202];
// int x, y;
// {
//   rd(N++,M,S);
//   rep(i,N) rep(j,N) mp[i][j] = 1;
//   x = N-1; y = 0;
//   mp[x][y] = 0;
//   rep(i,M){
//     if(S[i]=='R') y++;
//     if(S[i]=='L') y--;
//     if(S[i]=='U') x--;
//     if(S[i]=='D') x++;
//     mp[x][y] = 0;
//   }
//   wt(mp(N,N));
// }