#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    os << "{";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if (itr != map_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    os << "{";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr;
        ++itr;
        if (itr != set_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}

/**
 * @brief template
 */

vector<int> Dist(vector<vector<int>> G, int S) {
    int N = G.size();
    vector<int> Ret(N,inf);
    Ret[S] = 0;
    queue<int> Q;
    Q.push(S);
    while(!Q.empty()) {
        int P = Q.front();
        Q.pop();
        for (int NP : G[P]) {
            if (chmin(Ret[NP],Ret[P]+1)) {
                Q.push(NP);
            }
        }
    }
    return Ret;
}

vector<int> toBinary(int X) {
    vector<int> Ret;
    while(X > 0) Ret.push_back(X % 2), X /= 2;
    reverse(Ret.begin(), Ret.end());
    return Ret;
}

vector<int> PopFront(vector<int> A) {
    vector<int> Ret;
    rep(i,1,A.size()) Ret.push_back(A[i]);
    return Ret;
}

int main() {
    int MAXS = 100;
    int Start = 0, End = 99;
    int XL, XR;
    cin >> XL >> XR;
    XL--, XR++;
    auto L = toBinary(XL), R = toBinary(XR);
    vector<vector<pair<int,int>>> G(MAXS);
    auto AllBit = [&](int i) -> int {
        return End - i;
    };
    rep(i,0,20) {
        G[AllBit(i+1)].push_back({AllBit(i),0});
        G[AllBit(i+1)].push_back({AllBit(i),1});
    }
    if (L.size() == R.size()) {
        while(!L.empty()) {
            if (L[0] != R[0]) break;
            G[Start].push_back({Start+1,L[0]});
            Start++;
            L = PopFront(L);
            R = PopFront(R);
        }
    }
    else {
        rep(i,L.size(),R.size() - 1) G[Start].push_back({AllBit(i),1});
    }
    int LS = 30, RS = 55;
    rep(i,0,L.size()) {
        if (i == 0) G[Start].push_back({LS,L[i]});
        else {
            G[LS+i-1].push_back({LS+i,L[i]});
            if (L[i] == 0) G[LS+i-1].push_back({AllBit(L.size() - 1 - i), 1});
        }
    }
    rep(i,0,R.size()) {
        if (i == 0) G[Start].push_back({RS,R[i]});
        else {
            G[RS+i-1].push_back({RS+i,R[i]});
            if (R[i] == 1) G[RS+i-1].push_back({AllBit(R.size() - 1 - i), 0});
        }
    }
    vector<vector<int>> H(MAXS), RH(MAXS);
    rep(i,0,MAXS) {
        for (auto P : G[i]) {
            H[i].push_back(P.first);
            RH[P.first].push_back(i);
        }
    }
    Start = 0;
    auto DH = Dist(H,Start), DRH = Dist(RH,End);
    vector<pair<int,int>> V;
    rep(i,0,MAXS) {
        if (DH[i] < inf && DRH[i] < inf) V.push_back({DH[i],i});
    }
    sort(ALL(V));
    vector<int> ID(MAXS,-1);
    rep(i,0,V.size()) ID[V[i].second] = i;
    cout << V.size() << endl;
    for (auto P : V) {
        int i = P.second;
        vector<pair<int,int>> ANS;
        for (auto E : G[i]) {
            if (ID[E.first] == -1) continue;
            ANS.push_back({ID[E.first] + 1,E.second});
        }
        cout << ANS.size();
        rep(j,0,ANS.size()) {
            cout << ' ' << ANS[j].first << ' ' << ANS[j].second;
        }
        cout << endl;
    }
}