#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
// #define int long long
typedef long long LL;

inline int read(){
	int x = 0 , f = 1 ; char c = getchar() ;
    while( c < '0' || c > '9' ) { if( c == '-' ) f = -1 ; c = getchar() ; } 
    while( c >= '0' && c <= '9' ) { x = x * 10 + c - '0' ; c = getchar() ; } 
    return x * f ;
}

const int maxn = 1e5+20;
int n,m,l,r,cnt,k,fl;
int A[30],B[30],v[maxn],vis[maxn];
vector<pii> E[maxn];

void solve(){
    l = read();r = read();
    for(int i=0;i<=25;i++){
        A[i] = (l >> i) & 1;
        if(A[i]) n = i;
        B[i] = (r >> i) & 1;
        if(B[i]) m = i;
    }
    // cout<<n<<endl;
    // for(int i=0;i<=n;i++) cout<<A[i]<<" ";
    // puts("");
    // for(int i=0;i<=m;i++) cout<<B[i]<<" ";
    // puts("");
    // return ;
    if(l==r){
        int now = ++cnt;
        for(int i=m;i>=0;i--){
            int p = ++cnt;
            E[now].pb(mp(p,A[i]));
            now = p;
        }
        printf("%d\n",cnt);
        for(int i=1;i<=cnt;i++){
            printf("%d ",E[i].size());
            // cout<<i<<endl;
            for(pii x : E[i]) printf("%d %d ",x.first,x.second);
            puts("");
        }
        return ;
    }
    cnt = 1;k = -1;
    int S = ++cnt,T = 1;
    int now = S,Tmp = 0;
    for(int i=m;i>=0;i--){
        if(A[i]!=B[i]){
            l -= Tmp;r -= Tmp;
            if(!fl){
                for(int j=0;j<=25;j++){
                    if((1<<j) <= r && r < (1<<(j+1))) break;
                    else if(l<(1<<j) && (1<<(j+1))-1<r) k = max(k,j-1);
                }    
            }
            int lst = now;
            for(int j=i-1;j>=0;j--){
                if(B[j]) k = max(k,j-1);
            }
            if(fl){
                for(int j=i-1;j>=0;j--)
                    if(!A[j]) k = max(k,j-1);
            }
            else{
                for(int j=i-1;j>=0;j--){
                    if(!A[j] && !fl) continue;
                    else{
                        if(A[j]) fl = 1;
                        else k = max(k,j-1);
                    }
                }
                fl = 0;
            }
            for(int j=0;j<=25;j++){
                int tmp = j ? v[j-1] : T;
                if(j<=k){
                    v[j] = ++cnt;
                    E[v[j]].pb(mp(tmp,0));
                    E[v[j]].pb(mp(tmp,1));
                }
                if(!fl){
                    if(l<(1<<j) && (1<<(j+1))-1<r){
                        // cout<<l<<" "<<r<<endl;
                        // cout<<"ddd:"<<S<<" "<<tmp<<" "<<j<<endl;
                        E[now].pb(mp(tmp,1));
                        // k = max(k,j);
                    }
                }
            }
            now = lst;
            int tpp = i ? ++cnt : T;
            E[now].pb(mp(tpp,1));
            now = tpp;
            for(int j=i-1;j>=0;j--){
                if(B[j]) E[now].pb(mp((j ? v[j-1] : T),0));
                // if(B[j]) cout<<"Add:"<<now<<" "<<j<<" "<<v[j-1]<<endl;
                if(j) E[now].pb(mp(++cnt,B[j]));
                else E[now].pb(mp(T,B[j]));
                now = cnt;
            }
            if(fl){
                now = lst;
                int tpp = i ? ++cnt : T;
                E[now].pb(mp(tpp,0));
                now = tpp;
                for(int j=i-1;j>=0;j--){
                    if(!A[j]) E[now].pb(mp((j ? v[j-1] : T),1));
                    if(j) E[now].pb(mp(++cnt,A[j]));
                    else E[now].pb(mp(T,A[j]));
                    now = cnt;
                }
            }
            else{
                now = lst;
                for(int j=i-1;j>=0;j--){
                    if(!A[j] && !fl) continue;
                    else{
                        fl = 1;
                        if(!A[j]) E[now].pb(mp((j ? v[j-1] : T),1));
                        if(j) E[now].pb(mp(++cnt,A[j]));
                        else E[now].pb(mp(T,A[j]));
                        now = cnt;
                    }
                }
            }
            break;
        }
        else{
            fl = 1;
            E[now].pb(mp(++cnt,A[i]));
            now = cnt;
            if(A[i]) Tmp ^= (1<<i);
            // cout<<Tmp<<endl;
        }
    }
    printf("%d\n",cnt);
    for(int i=1;i<=cnt;i++){
        printf("%d ",E[i].size());
        for(pii x : E[i]) printf("%d %d ",x.first,x.second);
        puts("");
        // for(pii x : E[i]) printf("%d %d %d\n",i,x.first,x.second);
    }
}

signed main(){
	// freopen("1.txt","r",stdin);
	int T = 1;
	// T = read();
	while(T--) solve();
	return 0;
}