#include<bits/stdc++.h>
#define pb push_back
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=100+10;
int L,R,mzx,tot=2,s=1,t=2,flg,diff,len[MAXN];
vector<pair<int,int>> G[MAXN];
int hb(int s) {
	roff(i,20,0) if(s&(1<<i)) return i;
	return -1;	
}
void add_chain(int L) {
	mzx=1;
	roff(i,L,1) len[i]=++tot;
	len[0]=t;
	roff(i,L,1) G[len[i]].pb({len[i-1],0}),G[len[i]].pb({len[i-1],1});
	return ;
}
//pos1 是 1，pos2 是 0 
void output(void) {
	cout<<tot<<'\n';
	ffor(i,1,tot) {
		cout<<G[i].size()<<' ';
		for(auto pr:G[i]) cout<<pr.first<<' '<<pr.second<<' ';
		cout<<'\n';
	}
	return ;
}
int main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>L>>R,diff=L^R;
	int hr=hb(R),d=hb(diff);
	int pos1=s,pos2=s;
	if(d==-1) {
		roff(i,hr,1) ++tot,G[pos1].pb({tot,!!(R&(1<<i))}),pos1=pos2=tot;
		G[pos1].pb({t,!!(R&1)});
		return output(),0;
	}
	roff(i,hr,d+1) ++tot,G[pos1].pb({tot,!!(R&(1<<i))}),pos1=pos2=tot;
	if(d!=hr) {
		if(d) {
			++tot,G[pos1].pb({tot,1}),pos1=tot;
			++tot,G[pos2].pb({tot,0}),pos2=tot;
		}
		else {
			G[pos1].pb({t,1}),G[pos2].pb({t,0});	
		}
	}
	else {
		++tot,G[pos1].pb({tot,1}),pos1=tot;
	}
	roff(i,d-1,1) {
		if(R&(1<<i)) {
			if(!mzx) add_chain(i);
			G[pos1].pb({len[i],0});
			++tot,G[pos1].pb({tot,1}),pos1=tot;
		}
		else ++tot,G[pos1].pb({tot,0}),pos1=tot;
		if(L&(1<<i)) ++tot,G[pos2].pb({tot,1}),pos2=tot;
		else {
			if(!mzx) add_chain(i);
			G[pos2].pb({len[i],1});
			if(pos2!=s) ++tot,G[pos2].pb({tot,0}),pos2=tot;
		}
	}
	if(d) {
		if(R&1) G[pos1].pb({t,1});
		G[pos1].pb({t,0});
		if(!(L&1)) G[pos2].pb({t,0});
		G[pos2].pb({t,1});
	}
	output();
	return 0;
}