#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

ll val(P p){
    ll x = p.first, y = p.second, d = max(abs(x), abs(y)), r = d * 2 + 1, ms = r * r;
    if(y == - d) return ms + x - d;
    else if(x == -d) return ms - y - d * 3;
    else if(y == d) return ms - x - d * 5;
    else return ms + y - d * 7;
}

P pos(ll a){
    if(a == 1) return make_pair(0, 0);
    ll lb = -1, ub = 100000;
    while(ub - lb > 1){
        ll cen = (ub + lb) / 2, r = cen*2 + 1;
        (a <= r * r ? ub : lb) = cen;
    }
    ll r = ub * 2, r2 = ub, ms = (r + 1) * (r + 1);
    if((ms -= r) < a) return make_pair(-r2 + (a - ms), -r2);
    else if((ms -= r) < a) return make_pair(-r2, r2 - (a - ms));
    else if((ms -= r) < a) return make_pair(r2 - (a - ms), r2);
    else return make_pair(r2, -r2 + (a - (ms - r)));
}

string ans = "";
ll pena;
void move(P p, P q){
    ll dx = q.first - p.first, dy = q.second - p.second;
    rep(i, dx){
        ans.push_back('R');
        ++p.first;
        pena ^= val(p);
    }
    reps(i, dy, 0){
        ans.push_back('D');
        --p.second;
        pena ^= val(p);
    }
    rep(i, dy){
        ans.push_back('U');
        ++p.second;
        pena ^= val(p);
    }
    reps(i, dx, 0){
        ans.push_back('L');
        --p.first;
        pena ^= val(p);
    }
}

int main(){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    /*
    random_device seed;
    mt19937 mt(seed());
    uniform_int_distribution<> randAB(1, 1000000000);
    rep(i, 200000) {
        if(i%10000 == 0) cout<<i<<endl;
        A = randAB(mt);
        B = randAB(mt);
        while(A == B) B = randAB(mt);
        ans.clear();
        pena = 0;
    }
     */
    cin>>A>>B;
    P p = pos(A), q = pos(B);
    pena = A;
    move(p, q);
    ll tyousei = B ^pena;
    if(tyousei == 0){
        P qnx = make_pair(q.first, q.second + 1);
        move(q, qnx);
        move(qnx, q);
        tyousei = B ^ pena;
    }
    move(q, pos(tyousei));
    move(pos(tyousei), q);
    assert(pena == 0);
    cout<<0<<endl;
    cout<<ans.size()<<endl;
    cout<<ans<<endl;
}