#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1005;
int s, t, L, R, maxn, id, a[N];
vector<PII> G[N];
void link(int u, int v, int w){
    G[u].pb({v, w});
}
int get(int x){
    if(x > maxn){
        _rep(i, maxn + 1, x){
            a[i] = ++id, link(a[i], a[i - 1], 0), link(a[i], a[i - 1], 1);
        }
        maxn = x;
    }
    return a[x];
}
int dfs(int u, int L, int R, int lim, bool flag){
    if(u == -1) return t;
    if(!lim) return get(u + 1);
    int cl = L >> u & 1, cr = R >> u & 1;
    int x = 0;
    _rep(i, 0, 1){ 
        if((lim & 1) && i < cl) continue;
        if((lim & 2) && i > cr) continue;
        int nlim = (lim & (i == cl)) | (lim & ((i == cr) << 1));
        bool nflag = flag & (!i);
        if(flag){
        // if(u == 4 && i == 0) debug("fff nlim:%d nflag:%d\n", nlim, nflag);
            if(nflag) dfs(u - 1, L, R, nlim, nflag);
            else link(s, dfs(u - 1, L, R, nlim, nflag), 1);
        }else{
            if(!x) x = ++id;
            int v = dfs(u - 1, L, R, nlim, nflag);
            if(v) link(x, v, i);
        }
    }
    // debug("dfs u:%d lim:%d flag:%d x:%d\n", u, lim, flag, x);
    return x;
}
int main(){
    s = ++id, t = ++id, a[0] = t;
    read(L, R);
    dfs(max(__lg(L), __lg(R)), L, R, 3, 1);
    writeln(id);
    _rep(i, 1, id){
        writes(G[i].size());
        for(auto &j : G[i]) write(j.fi, j.se), putchar(' ');
        puts("");
    }
    return 0;
}