#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,M; string S; cin >> N >> M >> S;
  set<pair<int,int>> st;
  int x=0,y=0;
  st.insert({x,y});
  rep(i,M){
    if(S[i]=='U') y++;
    if(S[i]=='D') y--;
    if(S[i]=='L') x--;
    if(S[i]=='R') x++;
    st.insert({x,y});
  }
  for(int y=N;y>=0;y--){
    for(int x=0;x<=N;x++){
      if(x) cout << ' ';
      cout << 1-st.count({x,y});
    }
    cout << endl;
  }
  return 0;
}