#include<bits/stdc++.h>
using namespace std;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r+1)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
struct Edge {
  int to; ll w;
};
using Graph = vector<vector<int> >;
//using Graph = vector<vector<Edge> >;
const ll INF = 2e18;
//const int INF = 2e9;
template<class T> using vc = vector<T>;
template<class T> using vv = vector<vector<T> >;
template<class T> using vvv = vector<vector<vector<T> > >;
template<class T> using pq = priority_queue<T>;
template<class T> using pq_g = priority_queue<T, vc<T>, greater<T> >;
template<class T> istream& operator>>(istream& i, vc<T>& v) { rep(j, 0, v.size()) i>>v[j]; return i; }
template<class T> ostream& operator<<(ostream& o, vc<T>& v) { rep(j, 0, v.size()) o<<v[j]<<" "; return o; }
template<class T> bool chmin(T& a, T b) {
  if(a > b) {
      a = b;
      return true;
  }
  return false;
}
template<class T> bool chmax(T& a, T b) {
  if(a < b) {
      a = b;
      return true;
  }
  return false;
}

int main() {
  // 高速化
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  // 小数点の出力桁数を指定
  cout << fixed << setprecision(10);
  // メイン
  int N, T;
  cin >> N >> T;
  vv<int> A(N, vc<int>(N));
  cin >> A;

  vc<char> op;
  int s = 0;
  while(true) {
    ll cur = 0;
    ll curx, cury;
    rep(i, 0, N) rep(j, 0, N) {
      ll res = 0;
      int xor_ = s ^ A[i][j];
      rep(x, 0, N) rep(y, 0, N) {
        res += A[x][y] ^ xor_;
      }
      if(chmax(cur, res)) curx = i, cury = j;
    }
    s ^= A[curx][cury];
    vc<char> op_;
    rep(i, 0, curx-1) op_.push_back('D');
    rep(i, 0, cury-1) op_.push_back('R');
    op_.push_back('C');
    rep(i, 0, curx-1) op_.push_back('U');
    rep(i, 0, cury-1) op_.push_back('L');
    rep(i, 0, N) {
      rep(j, 0, N) {
        op_.push_back('W');
        A[i][j] ^= s;
        if(j != N-1) {
          if(i%2==0) op_.push_back('R');
          else op_.push_back('L');
        } else if(i != N-1) op_.push_back('D');
      }
    }
    rep(i, 0, N-1) op_.push_back('U');

    if(op.size() + op_.size() <= T) {
      rep(i, 0, op_.size()) op.push_back(op_[i]);
    } else break;
  }
  rep(i, 0, op.size()) cout << op[i] << endl;

  return 0;
}