#include<bits/stdc++.h>
#define N 1000007

using namespace std;

int L,R,n,tmp,num[N];
vector<pair<int,int> > G[N];

void solve(int k,int l,int r,int x,bool fl){
	if(l==0&&r==(1<<k+1)-1){
		while(tmp<k){
			num[++tmp]=++n;
			G[n].push_back({num[tmp-1],0}),G[n].push_back({num[tmp-1],1});
		}
		G[x].push_back({num[k],0}),G[x].push_back({num[k],1});
		return;
	}
	if(!k) return G[x].push_back({num[0],l}),void();
	int dl=l>>k&1,dr=r>>k&1;
	if(dl==dr){
		if(!dl&&!fl) solve(k-1,l^dl<<k,r^dr<<k,x,0);
		else G[x].push_back({++n,dl}),solve(k-1,l^dl<<k,r^dr<<k,n,1);
	}
	else{
		if(fl) G[x].push_back({++n,0}),solve(k-1,l^dl<<k,(1<<k)-1,n,1);
		else solve(k-1,l^dl<<k,(1<<k)-1,x,0);
		G[x].push_back({++n,1}),solve(k-1,0,r^dr<<k,n,1);
	}
}

int main()
{
	scanf("%d%d",&L,&R);
	n=2,num[0]=2;
	solve(19,L,R,1,0);
	printf("%d\n",n);
	for(int i=1;i<=n;i++){
		printf("%d\n",G[i].size());
		for(auto p:G[i]) printf("%d %d\n",p.first,p.second);
	}
	return 0;
}