#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using tii=tuple<int,int,int>;
using qii=tuple<int,int,int,int>;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
constexpr int INF=1e9;
constexpr ll INF_ll=1e18;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define replr(i,l,r) for (int i=(int)(l);i<(int)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((int)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}

namespace Timer{
    chrono::system_clock::time_point program_start,start;
    void program_start_snap(){
        program_start=start=chrono::system_clock::now();
    }
    void snap(){
        start=chrono::system_clock::now();
    }
    int get_ms(){
        auto now=chrono::system_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-start).count();
        return ms;
    }
    int get_ms_all_program(){
        auto now=chrono::system_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-program_start).count();
        return ms;
    }
}

mt19937 mt;
uint32_t rand_int(uint32_t r){  //[0,r)
    assert(r!=0);
    return ((uint64_t)mt()*r)>>32;
}
int rand_int(int l,int r){  //[l,r)
    assert(l<r);
    return l+rand_int(r-l);
}
constexpr double one_div_mt_max=1.0/(double)mt19937::max();
double rand_double(){  //[0.0,1.0]
    return mt()*one_div_mt_max;
}

template<class T> void add(vector<T> &a,const vector<T> b){
    for(auto i:b) a.emplace_back(i);
}

constexpr int N=10,T=1000;

int one(int i,int j){
    return i*N+j;
}

vector<int> A;

string Operation="UDLRWC";

vector<vector<vector<int>>> path;

namespace Solver{
    void solve(){

        vector<int> a=A;

        vector<int> ans;

        int s=0,pos=0;

        vector<int> used_b0(N*N,false);

        for(int bit=19;0<=bit;bit--){


            
            
            if(!(s&(1<<bit))){

                if(bit!=19){

                    int idx=-1;

                    rep(i,N*N){
                        if(!used_b0[i]&&!(a[i]&(1<<bit))){
                            idx=i;
                            break;
                        }
                    }

                    if(idx==-1) continue;

                    add(ans,path[pos][idx]);

                    pos=idx;

                    ans.push_back(5);
                    s^=a[pos];

                    idx=-1;

                    rep(i,N*N){
                        if(!used_b0[i]&&a[i]&(1<<bit)){
                            idx=i;
                            break;
                        }
                    }

                    if(idx==-1) continue;

                    add(ans,path[pos][idx]);

                    pos=idx;

                    ans.push_back(5);
                    s^=a[pos];
                }else{
                    int idx=-1;

                    rep(i,N*N){
                        if(!used_b0[i]&&a[i]&(1<<bit)){
                            idx=i;
                            break;
                        }
                    }

                    if(idx==-1) continue;

                    add(ans,path[pos][idx]);

                    pos=idx;

                    ans.push_back(5);
                    s^=a[pos];
                }

            }


            int b0=-1,b1=-1;

            if(bit!=19){

                rep(i,N*N){
                    if(!(a[i]&(1<<bit))&&!used_b0[i]){
                        b0=i;
                    }
                }
                
                used_b0[b0]=true;

            }


            
            rep(i,N*N){
                if(i==b0) continue;

                
                if(!used_b0[i]) b1=i;

                if(!(a[i]&(1<<bit))){
                    add(ans,path[pos][i]);
                    ans.push_back(4);
                    a[i]^=s;
                    pos=i;
                    if(!used_b0[i]) b1=i;
                }
            }

            if(bit!=19){

                if(b0==-1) break;

                add(ans,path[pos][b0]);
                pos=b0;
                ans.push_back(5);
                
                s^=a[pos];
                
                add(ans,path[pos][b1]);
                pos=b1;
                ans.push_back(5);
                s^=a[pos];
            }else{
                ans.push_back(5);
                s^=a[pos];
            }

            
        }

        

        if(T<len(ans)) ans.resize(T);



        for(auto i:ans) cout << Operation[i] << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Timer::program_start_snap();

    int n,t;
    cin >> n >> t;

    A.resize(N*N);

    rep(i,N*N) cin >> A[i];

    path.resize(N*N,vector<vector<int>>(N*N));

    rep(ai,N){
        rep(aj,N){
            rep(bi,N){
                rep(bj,N){
                    vector<int> v;
                    if(ai<bi){
                        rep(_,bi-ai) v.push_back(1);
                    }else{
                        rep(_,ai-bi) v.push_back(0);
                    }
                    if(aj<bj){
                        rep(_,bj-aj) v.push_back(3);
                    }else{
                        rep(_,aj-bj) v.push_back(2);
                    }
                    path[one(ai,aj)][one(bi,bj)]=v;
                }
            }
        }
    }


    Solver::solve();
    exit(0);
}