#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	string S;
	cin >> S;
	vector kimu(N + 1, vector(N + 1, true));
	int x = 0, y = N;
	kimu[y][x] = false;
	int dx[] {0,1,-1,0}, dy[] {-1,0,0,1};
	string move = "URLD";
	map<char, int> conv;
	REP(i, move.size()) conv[move[i]] = i;
	for (char c : S) {
		const int dir = conv[c];
		x += dx[dir];
		y += dy[dir];
		if (x >= 0 && x <= N && y >= 0 && y <= N) kimu[y][x] = false;
	}
	REP(i, N + 1) REP(j, N + 1) printf("%d%c", (int)kimu[i][j], " \n"[j + 1 == N + 1]);
}