#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define db double
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define sky fflush(stdout)
#define gc getchar
#define pc putchar
namespace IO{
	template<class T>
	inline void read(T &s){
		s = 0;char ch = gc();bool f = 0;
		while(ch < '0' || '9'<ch) {if(ch == '-') f = 1; ch = gc();}
		while('0'<=ch && ch<='9') {s = s * 10 + (ch ^ 48); ch = gc();}
		if(ch == '.'){
			T p = 0.1;ch = gc();
			while('0' <= ch && ch <= '9') {s = s + p * (ch ^ 48);p /= 10;ch = gc();}
		}
		s = f ? -s : s;
	}
	template<class T,class ...A>
	inline void read(T &s,A &...a){
		read(s); read(a...);
	}
	template<class T>
	inline void write(T x){
		if(x<0) {x = -x; pc('-');}
		static char st[40];
		static int top;
		top = 0;
		do{st[++top] = x - x / 10 * 10 + '0';} while(x /= 10);
		while(top) {pc(st[top--]);}
	}
};
using IO::read;
using IO::write;
#define lowbit(x) (x & -x)
int highbit(int x){
	if(x == 0) return 0;
	int y;
	while(true){
		y = x;
		x -= lowbit(x);
		if(!x) break;
	}
	return y;
}
const int N = 100;
int l, r;
struct Edge{
	int v, w;	
};
std::vector<Edge>G[N + 3];
int n;
int ty[21];
int main(){
#ifdef LOCAL
	file(a);
#endif
	read(l, r);
	n = 2;
	ty[0] = 2;
	int mx = 0;
	if(highbit(l) == highbit(r) ){
		int a = 1, b = 1;
		int ld = 20;
		while(!(l >> ld & 1) ) --ld;
		bool flag = 1;
		for(int i = ld; i >= 0; --i){
			int c1 = l >> i & 1, c2 = r >> i & 1;
			if(c1 == c2 && flag){
				if(i != 0) G[a].push_back({++n, c1});
				else G[a].push_back({2, c1});
				a = b = n;
			}else{
				if(i != 0) G[a].push_back({++n, c1});
				else G[a].push_back({2, c1}); 
				if(!flag && c1 == 0) G[a].push_back({101 + i, 1}), mx = std::max(mx, i);
				a = n;
				if(i != 0) G[b].push_back({++n, c2});
				else G[b].push_back({2, c2}); 
				if(!flag && c2 == 1) G[b].push_back({101 + i, 0}), mx = std::max(mx, i);
				b = n;
				flag = 0;
			}
		}
	}else{
		int ld = 20;
		while(!(l >> ld & 1) ) --ld;
		int p = 1;
		for(int i = ld; i >= 0; --i){
			int c = l >> i & 1;
			if(i != 0) G[p].push_back({++n, c});
			else G[p].push_back({2, c});
			if(c == 0 && i != ld) G[p].push_back({101 + i, 1}), mx = std::max(mx, i);
			p = n;
		}
		ld = 20;
		while(!(r >> ld & 1) ) --ld;
		p = 1;
		for(int i = ld; i >= 0; --i){
			int c = r >> i & 1;
			if(i != 0) G[p].push_back({++n, c});
			else G[p].push_back({2, c});
			if(c == 1 && i != ld) G[p].push_back({101 + i, 0}), mx = std::max(mx, i);
			p = n;
		}
		r = highbit(r) >> 1;
		int now = ld - 1;
		while(highbit(r) != highbit(l) ){
			G[1].push_back({101 + now, 1});
			mx = std::max(mx, now);
			--now;
			r >>= 1;
		}
	}
	for(int i = 1; i <= mx; ++i){
		ty[i] = ++n;
		G[ty[i] ].push_back({ty[i - 1], 0});
		G[ty[i] ].push_back({ty[i - 1], 1});
	}	
	printf("%d\n", n);
	for(int i = 1; i <= n; ++i){
		printf("%d ", G[i].size() );
		for(auto it : G[i]){
			printf("%d %d ", it.v <= 100 ? it.v : ty[it.v - 101], it.w);
		}pc('\n');
	}
	return 0;
}