#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #include<boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
random_device seed_gen;
mt19937_64 rnd(seed_gen());
template <typename T> bool chmax(T& A, T B) { if (A < B) { A = B; return true; } return false; }
template <typename T> bool chmin(T& A, T B) { if (A > B) { A = B; return true; } return false; }
#define rep(i, m, n) for (int i = (m); i < (n); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using ll = long long;
using pint = pair<ll, ll>;
template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
#define PI 3.14159265358979323846264338327950288419716939937510
void bns(ll x, int p = 60) { for (int i = p - 1; i >= 0; i--) { cerr << (x >> i & 1LL); } cerr << endl; }

int n, t;
vector<vector<int>> a;
vector<int> di = {-1, 1, 0, 0};
vector<int> dj = {0, 0, -1, 1};
string chars = "UDLR";
string res = "";

void input() {
    cin >> n >> t;
    a.assign(n, vector<int>(n));
    rep (i, 0, n) rep (j, 0, n) cin >> a[i][j];
}

void init_ans() {
    int i = 0, j = 0;
    int s = 0;
    rep (ti, 0, t) {
        if (res.size() > t - 3) break;
        vector<int> d = {0, 1, 2, 3};
        shuffle(all(d), rnd);
        rep (k, 0, 4) {
            int ni = i + di[d[k]], nj = j + dj[d[k]];
            if (ni >= 0 && ni < n && nj >= 0 && nj < n) {
                res += chars[d[k]];
                i = ni, j = nj;
                res += "WC";
                a[ni][nj] ^= s;
                s ^= a[ni][nj];
                break;
            }
        }
    }
}
void output() {
    rep (ti, 0, t) cout << res[ti] << endl;
}
void solve() {
    input();
    init_ans();
    output();
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    solve();
    return 0;
}