#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (int)(n); i++)
using ll = long long;

vector<int> movevec = {0, 1, 0, -1, 0};
vector<char> movedir = {'R', 'D', 'L', 'U'};

int main()
{
    int n, t;
    cin >> n >> t;
    vector<vector<int>> grid(n, vector<int>(n));
    rep(i, 0, n) rep(j, 0, n) cin >> grid[i][j];
    int nowx = 0, nowy = 0;
    int score = 0;
    string ans = "";
    rep(_, 0, t)
    {
        int maxres = 0;
        int dir = 0;
        rep(d, 0, 4)
        {
            int nx = nowx + movevec[d], ny = nowy + movevec[d + 1];
            if ((0 <= nx && nx < n) && (0 <= ny && ny < n))
            {
                if (maxres < score ^ grid[nx][ny])
                {
                    maxres = score ^ grid[nx][ny];
                    dir = d;
                }
            }
        }
        ans += movedir[dir];
        nowx += movevec[dir];
        nowy += movevec[dir];
    }
    for (char c : ans)
    {
        cout << c << endl;
    }
}