#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template<class T> 
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    for (int i = 0; i < int(v.size()); i++) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

int c2(int x) {
    return (x*2+1)*(x*2+1);
}

pii calc(int n) {
    int d = 0;
    while (c2(d+1) <= n) d++;
    n -= c2(d);

    int x = d, y = d;
    if (n==0) return pii(x,y);
    y++;

    int w = (d+1)*2;
    if (n <= w) {
        n--;
        x -= n;
        return pii(x,y);
    }
    n -= w;
    x -= w-1;
    y--;
    if (n <= w) {
        n--;
        y -= n;
        return pii(x,y);
    }
    n -= w;
    y -= w-1;
    x++;
    if (n <= w) {
        n--;
        x += n;
        return pii(x,y);
    }
    n -= w;
    x += w-1;
    y += n;
    return pii(x,y);
}

vector<pii> solve(int n, bool flag) {
    vector<pii> ret;
    auto[tx,ty] = calc(n);
    int sx = 0, sy = 0;
    if (flag) {
        if (n&1) {
            ret.emplace_back(0,0);
            ret.emplace_back(0,1);
            ret.emplace_back(-1,1);
            sx = -1, sy = 1;
        } else {
            rep(_,2) {
                ret.emplace_back(0,0);
                ret.emplace_back(0,1);
            }
            sx = 0, sy = 1;
        }
    } else {
        if (~n&1) {
            ret.emplace_back(0,1);
            ret.emplace_back(0,0);
            ret.emplace_back(0,1);
            ret.emplace_back(-1,1);
            ret.emplace_back(0,1);
            sx = 0, sy = 1;
        }
    }

    while (true) {
        if (sx==tx and sy==ty) break;
        if (sx==tx) {
            if (sy < ty) {
                ret.emplace_back(sx,sy+1);
                ret.emplace_back(sx,sy+2);
                ret.emplace_back(sx,sy+1);
                ret.emplace_back(sx,sy+2);
                sy += 2;
            } else {
                ret.emplace_back(sx,sy-1);
                ret.emplace_back(sx,sy-2);
                ret.emplace_back(sx,sy-1);
                ret.emplace_back(sx,sy-2);
                sy -= 2;
            }
        } else if (sy==ty) {
            if (sx < tx) {
                ret.emplace_back(sx+1,sy);
                ret.emplace_back(sx+2,sy);
                ret.emplace_back(sx+1,sy);
                ret.emplace_back(sx+2,sy);
                sx += 2;
            } else {
                ret.emplace_back(sx-1,sy);
                ret.emplace_back(sx-2,sy);
                ret.emplace_back(sx-1,sy);
                ret.emplace_back(sx-2,sy);
                sx -= 2;
            }
        } else {
            int dx = sx < tx ? 1 : -1;
            int dy = sy < ty ? 1 : -1;
            rep(_,2) {
                ret.emplace_back(sx+dx,sy);
                ret.emplace_back(sx+dx,sy+dy);
            }
            sx += dx;
            sy += dy;
        }
    }
    return ret;
}

int main() {
    int S,T; cin >> S >> T;
    auto A = solve(S,true);
    auto B = solve(T,false);
    reverse(all(A));
    copy(all(B),back_inserter(A));
    cout << 0 << ln;
    cout << SZ(A)-1 << ln;
    rep(i,SZ(A)-1) {
        auto [x,y] = A[i];
        auto [nx,ny] = A[i+1];
        if (x < nx) cout << "D";
        if (x > nx) cout << "U";
        if (y < ny) cout << "R";
        if (y > ny) cout << "L";
    }
    cout << ln;

}