#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
//#include "../graph_tree/graph_template.hpp"
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
#line 1 "cpplib/math/xor_convolution.hpp"
template <typename T>
vector<T>xor_conv(vector<T> s,vector<T> t){
    auto fwt=[](vector<T>& f){
        int n = f.size();
        for (int i = 1; i < n; i <<= 1) {
            for (int j = 0; j < n; j++) {
                if ((j & i) == 0) {
                    T x = f[j], y = f[j | i];
                    f[j] = x + y, f[j | i] = x - y;
                }
            }
        }
    };
    auto ifwt=[](vector<T>& f){
        int n = f.size();
        for (int i = 1; i < n; i <<= 1) {
            for (int j = 0; j < n; j++) {
                if ((j & i) == 0) {
                    T x = f[j], y = f[j | i];
                    f[j] = (x + y) / 2, f[j | i] = (x - y) / 2;
                }
            }
        }
    };
    fwt(s);
    fwt(t);
    for(int i=0;i<(int)s.size();i++){
        s[i]*=t[i];
    }
    ifwt(s);
    return s;
}
#line 3 "code.cpp"

int main(){
    vector<lint>tmp(100000LL);
    rep(i,100000LL){
        tmp[i]=(i*2+1)*(i*2+1);
    }
    auto find=[&](lint x){
        if(x==1){
            return make_pair(0LL,0LL);
        }
        lint idx=lower_bound(all(tmp),x)-tmp.begin();
        x-=(idx*2-1)*(idx*2-1);
        if(x<=idx*2){
            return make_pair(idx,-idx+x);
        }
        x-=idx*2;
        if(x<=idx*2){
            return make_pair(idx-x,idx);
        }
        x-=idx*2;
        if(x<=idx*2){
            return make_pair(-idx,idx-x);
        }
        x-=idx*2;
        if(x<=idx*2){
            return make_pair(-idx+x,-idx);
        }
        return make_pair(INF,INF);
    };
    auto get=[&](lint x,lint y){
        if(x==0&&y==0)return 1LL;
        lint k=max(abs(x),abs(y)),res=(k*2-1)*(k*2-1);
        if(x==k&&y==-k){
            return (k*2+1)*(k*2+1);
        }
        if(x==k){
            return res+(y+k);
        }
        if(y==k){
            return res+k*2+(k-x);
        }
        if(x==-k){
            return res+k*4+(k-y);
        }
        if(y==-k){
            return res+k*6+(k+x);
        }
        return -1LL;
    };
    lint s,t;
    cin>>s>>t;
    auto [sx,sy]=find(s);
    auto [tx,ty]=find(t);
    string ans,ans2,ans3,ans4;
    lint cnt=s^t;
    {
        while(sx<0){
            sx++;
            ans+="R";
            cnt^=get(sx,sy);
        }
        while(sx>0){
            sx--;
            ans+="L";
            cnt^=get(sx,sy);
        }
        while(sy<0){
            sy++;
            ans+="U";
            cnt^=get(sx,sy);
        }
        while(sy>0){
            sy--;
            ans+="D";
            cnt^=get(sx,sy);
        }
    }
    {
        while(tx<0){
            tx++;
            ans2+="L";
            cnt^=get(tx,ty);
        }
        while(tx>0){
            tx--;
            ans2+="R";
            cnt^=get(tx,ty);
        }
        while(ty<0){
            ty++;
            ans2+="D";
            cnt^=get(tx,ty);
        }
        while(ty>0){
            ty--;
            ans2+="U";
            cnt^=get(tx,ty);
        }
    }
    auto [ux,uy]=find(cnt);
    {
        while(ux<0){
            ux++;
            ans3+="L";
            ans4+="R";
        }
        while(ux>0){
            ux--;
            ans3+="R";
            ans4+="L";
        }
        while(uy<0){
            uy++;
            ans3+="D";
            ans4+="U";
        }
        while(uy>0){
            uy--;
            ans3+="U";
            ans4+="D";
        }
    }
    reverse(all(ans2));
    reverse(all(ans4));
    string ans5=ans+ans3+ans4+ans2;
    // {
    //     auto [sx,sy]=find(s);
    //     auto [tx,ty]=find(t);
    //     lint cnt=s;
    //     for(auto e:ans5){
    //         if(e=='L')sx--;
    //         if(e=='R')sx++;
    //         if(e=='D')sy--;
    //         if(e=='U')sy++;
    //         cnt^=get(sx,sy);
    //     }
    //     assert(sx==tx&&sy==ty);
    //     cerr<<cnt<<endl;
    // }
    assert(ans5.size()<=200000);
    cout<<0<<endl;
    cout<<ans5.size()<<endl;
    cout<<ans5<<endl;
}