#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define x first
#define y second
#define endl '\n'
const int N=2e5+10;
int len(int x) {
	int cnt=0;
	while(x) {
		x/=2;
		cnt++;
	}
	return cnt;
}
string tos(int x) {
	string s;
	do {
		s+=(x%2+'0');
		x/=2;
	} while(x);
	return s;
}
void solve() {
	int l,r;
	int cnt=100;
	cin>>l>>r;
	if(l==r) {
		string s=tos(l);
		reverse(s.begin(),s.end());
		cnt=1;
		cout<<s.size()+1<<"\n";
		for(int i=0; i<s.size(); i++) {
			cout<<1<<" "<<cnt+1<<" "<<s[i]-'0'<<"\n";
			cnt++;
		}
		cout<<"0\n";
		return;
	}
	vector<PII>G[101];
	for(int i=19; i>1; i--) {
		G[i].push_back({i-1,0});
		G[i].push_back({i-1,1});
	}
	int len1=len(l),len2=len(r);
	for(int i=len1+1; i<len2; i++) {
		G[100].push_back({i,1});
	}
	if(len1!=len2) {
		string s;
		s=tos(l);
		s=" "+s;
		if(l!=1) G[100].push_back({--cnt,1});
		else G[100].push_back({1,1});
		for(int i=len1-1; i>=1; i--) {
			if(i==1) {
				G[cnt].push_back({i,1});
				if(s[i]-'0'==0) G[cnt].push_back({i,0});
			} else if(s[i]=='0') {
				G[cnt].push_back({i,1});
				G[cnt].push_back({cnt-1,0});
				cnt--;
			} else {
				G[cnt].push_back({cnt-1,1});
				cnt--;
			}
		}
		s=tos(r);
		s=" "+s;
		G[100].push_back({--cnt,1});
		for(int i=len2-1; i>=1; i--) {
			if(i==1) {
				G[cnt].push_back({i,0});
				if(s[i]-'0') G[cnt].push_back({i,1});
			} else if(s[i]=='1') {
				G[cnt].push_back({i,0});
				G[cnt].push_back({cnt-1,1});
				cnt--;
			} else {
				G[cnt].push_back({cnt-1,0});
				cnt--;
			}
		}
	} else {
		string s1=tos(l),s2=tos(r);
		s1=" "+s1;
		s2=" "+s2;
		int f1=99,f2=98;
		G[100].push_back({99,1});
		G[100].push_back({98,1});
		cnt=98;
		for(int i=len1-1; i>=1; i--) {
			if(i==1) {
				G[f1].push_back({1,s1[i]-'0'});
				G[f2].push_back({1,s2[i]-'0'});
				break;
			}
			G[f1].push_back({cnt-1,s1[i]-'0'});
			cnt--;
			f1=cnt;
			G[f2].push_back({cnt-1,s2[i]-'0'});
			cnt--;
			f2=cnt;
			if(s1[i]!=s2[i]) {
				for(int j=i-1; j>=1; j--) {
					if(j==1) {
						G[f1].push_back({j,1});
						if(s1[j]-'0'==0) G[f1].push_back({j,0});
					} else if(s1[j]=='0') {
						G[f1].push_back({j,1});
						G[f1].push_back({--cnt,0});
						f1=cnt;
					} else {
						G[f1].push_back({--cnt,1});
						f1=cnt;
					}
				}
				for(int j=i-1; j>=1; j--) {
					if(j==1) {
						G[f2].push_back({j,0});
						if(s2[j]-'0') G[f2].push_back({j,1});
					} else if(s2[j]=='1') {
						G[f2].push_back({j,0});
						G[f2].push_back({cnt-1,1});
						cnt--;
						f2=cnt;
					} else {
						G[f2].push_back({cnt-1,0});
						cnt--;
						f2=cnt;
					}
				}
				break;
			}
		}
	}
	queue<int> q;
	q.push(100);
	vector<int> mp(200);
	vector<int> mmp(200);
	int k=0;
	vector<int> vis(200);
	vis[100]=1;
	int t=-1;
	for(int i=1;i<=100;i++){
		if(G[i].size()){
			for(auto t:G[i]){
				//cout<<i<<" "<<t.x<<" "<<t.y<<endl;
			}
		}
	}
	vector<int> b;
	b.push_back(100);
	while(q.size()) {
		int u=q.front();
		q.pop();
		for(auto v:G[u]) {
			//cout<<u<<" "<<v.x<<endl;
			if(vis[v.x]) continue;
			vis[v.x]=1;
			q.push(v.x);
			//cout<<k<<" "<<v.x<<endl;
			b.push_back(v.x);
		}
	}
	sort(b.begin(),b.end(),greater<int>());
	for(int i=0; i<b.size(); i++) {
		mp[++k]=b[i];
		mmp[b[i]]=k;
	}
	cout<<k<<"\n";
	vector<int> in(200);
	for(int i=1; i<=k; i++) {
		//cout<<i<<" "<<mp[i]<<endl;
		cout<<G[mp[i]].size()<<" ";
		for(auto t:G[mp[i]]) {
			in[mmp[t.x]]++;
			cout<<mmp[t.x]<<" "<<t.y<<" ";
		}
		cout<<"\n";
	}
//	queue<PII> Q;
//	Q.push({1,0});
//	map<int,int> MP;
//	while(Q.size()) {
//		PII u=Q.front();
//		Q.pop();
//		for(auto t:G[mp[u.x]]) {
//			int x=u.y*2+t.y;
////			cout<<t.x<<" "<<mmp[t.x]<<endl;
//			if(mmp[t.x]==k) {
//				if(x<l||x>r) {
//					cout<<"No";
//					return;
//				}
//				MP[x]++;
//				//cout<<x<<endl;
//			}
//			Q.push({mmp[t.x],x});
//		}
//	}
//	for(int i=l; i<=r; i++) {
//		if(MP[i]!=1) {
//			cout<<"No";
//			return;
//		}
//	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int T=1;
	//cin>>T;
	while(T--) {
		solve();
	}
	return 0;
}