#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<functional>
#include<utility>
#include<cassert>
using namespace std;
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 << 3) + (x << 1) + (c ^ 48);
		c = getchar();
	}
	return x * f;
}
const int N = 111;
int trie[N][2],id[N],mi[25],flag[N];
int p,res,cnt,L,R,cc,tot = 1;
vector<int> vis[N];
vector<pair<int,int> > v[N];
void insert(int c,int p){
	int i = 24,o = 1;
	while(!(c & mi[i])) --i;
	for(;i >= 0;i--){
		flag[o] = 1;
		int ch = ((c & mi[i]) > 0);
		if(!trie[o][ch]) trie[o][ch] = ++tot;
		o = trie[o][ch];
	}
	vis[o].push_back(p);
}
void print(int o){
	if(!trie[o][0] && !trie[o][1]) return;
	for(int i = 0;i < 2;i++){
		if(!id[o]) id[o] = ++cnt;
		int temp = id[o];
		if(trie[o][i]){
			if(flag[trie[o][i]]){
				id[trie[o][i]] = ++cnt;
				v[temp].push_back(make_pair(cnt,i));
			}
			if(vis[trie[o][i]].size()){
				for(int j = 0;j < (int)vis[trie[o][i]].size();j++){
					v[temp].push_back(make_pair(vis[trie[o][i]][j] + 1,i));
				}
			}
			print(trie[o][i]);
		}
	}
}
int main(){
	//freopen("a.out","w",stdout);
	int t,i,j,k,x,y;
	mi[0] = 1;
	for(i = 1;i <= 24;i++) mi[i] = mi[i - 1] << 1;
	L = read(),R = read();
	while(L <= R){
		x = L,p = 0;
		for(i = 0;i <= 24;i++){
			if(L & mi[i]) break;
			if(L + (mi[i + 1] - 1) <= R) x = L + mi[i + 1] - 1,p = i + 1;
			else break;
		}
		cnt = max(cnt,p);
		insert(L >> p,p);
		//printf("%d %d %d\n",L,x,p);
		L = x + 1;
	}
	//printf("%d?\n",cnt);
	for(i = 1;i <= cnt;i++){
		res += 2;
		v[i + 1].push_back(make_pair(i,0));
		v[i + 1].push_back(make_pair(i,1));
	}
	++cnt;
	print(1);
	printf("%d\n",cnt);
	for(i = 1;i <= cnt;i++){
		printf("%d ",(int)v[i].size());
		for(j = 0;j < (int)v[i].size();j++){
			printf("%d %d ",v[i][j].first,v[i][j].second);
		}
		puts("");
	}
	return 0;
}