#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) {return mrand()%x;}
const ll mod=998244353;
// head

int l,r,cur,tot=1;
int idx[30];
vector<pii> ans[210];

int get(int b) {
	while (cur<=b) {
		int now=++tot;
		if (cur>0) {
			ans[tot].pb({idx[cur-1],0});
			ans[tot].pb({idx[cur-1],1});
		}
		idx[cur]=tot;
		cur++;
	}
	return idx[b];
}

int dfs(int b,int l1,int r1,int l2,int r2) {
	if (l2<=l1 and r1<=r2) return get(b);
	int now=++tot;
	int mid=(l1+r1)>>1;
	if (l2<mid) { // this position is zero
		ans[now].pb({dfs(b-1,l1,mid,l2,r2),0});
	}
	if (mid<r2) { // this position is one
		ans[now].pb({dfs(b-1,mid,r1,l2,r2),1});
	}
	return now;
}

void solve() {
	cin>>l>>r;
	for (int i=0;i<=20;i++) {
		int l1=1<<i;
		int r1=1<<(i+1);
		int l2=max(l1,l);
		int r2=min(r1,r+1);
		if (l2>=r2) continue;
		ans[1].pb({dfs(i,l1,r1,l2,r2),1});
	}
	cout<<tot<<endl;
	rep(i,1,tot+1) {
		cout<<SZ(ans[i])<<" ";
		for (auto [a,b] : ans[i]) {
			cout<<a<<" "<<b<<" ";
		}
		cout<<endl;
	}
}

int tc;
signed main() {
	ios::sync_with_stdio(0);
	tc=1;
	while (tc--) solve();
}