#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
map<int,int>mp[N];
vector<pair<int,int>>e[N];
int n,l,r;
int solve(int l,int r){
	if (mp[l][r]) return mp[l][r];
	mp[l][r]=++n;
	if (l==0&&r==0) return n;
	if (l==1){
		e[1].emplace_back(n,1);
		l++;
	}
	int x=n;
	int l0=(l%2==0?l/2:(l+1)/2);
	int r0=(r%2==0?r/2:(r-1)/2);
	int l1=(l%2==1?l/2:(l+1)/2);
	int r1=(r%2==1?r/2:(r-1)/2);
	if (l0<=r0){
		int id=solve(l0,r0);
		e[id].emplace_back(x,0);
	}	
	if (l1<=r1){
		int id=solve(l1,r1);
		e[id].emplace_back(x,1);	
	}
	return x;
}
int main(){
	scanf("%d%d",&l,&r);
	n=1;
	mp[0][0]=1;
	solve(l,r);
	printf("%d\n",n);
	for (int i=1;i<=n;i++){
		printf("%d ",e[i].size());
		for (int j=0;j<e[i].size();j++){
			printf("%d %d ",e[i][j].first,e[i][j].second);
		}
		printf("\n");
	}
}