#include <bits/stdc++.h>
using namespace std;
#define endl '\n'

const int MAX = 1100;
unordered_map<int, int> mp;
int L, R;
int cnt = 2;
int S = 1, T = 2;
int l[MAX], r[MAX];

int tree[MAX][5];
vector<pair<int, int> > Se;

int lowbit(int x) {
	return x & -x;
}

void print2(int x) {
	if (x <= 1) {
		cout << x;
	} else {
		print2(x / 2);
		cout << x % 2;
	}
}

int ta[50], tb[50], lim1, lim2;
void get(int a, int b) {
	lim2 = 0;
	while (a) {
		ta[++lim2] = a & 1;
		a >>= 1;
	}
	lim2 = 0;
	while (b) {
		tb[++lim2] = b & 1;
		b >>= 1;
	}

	for (int i = lim2; i >= 1; i--) {
		if (ta[i] == tb[i]) {
			lim1 = i;
		} else break;
	}
}

int main() {
//	cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
	mp[1] = T;
	cin >> L >> R;
	int tmp = 0;
	int now = L;
	for (int i = L; i <= R;) {
//		cout<<i<<endl;
		l[++tmp] = i, r[tmp] = (i + lowbit(i)) - 1;
		i = i + lowbit(i);
		if (i <= R)
			now = i;
	}
	tmp--;
	
//	cout<<"now:"<<now<<endl;
	
	while (now < R) {
		l[++tmp] = now;
		int t = 0;
		while (now + (1 << t) - 1 <= R) t++;
		t--;
		now += (1 << t);
		r[tmp] = now - 1;
	}
	if (now == R) l[++tmp] = R, r[tmp] = R;

//	for(int i = 1; i <= tmp; i++){
//		print2(l[i]); puts("");
//		print2(r[i]); puts(""); puts("");
//	}

	for (int i = 1; i <= tmp; i++) {
		
		get(l[i], r[i]);
		
		if(l[i] == 1){
			Se.push_back({T, 1});
			continue;
		}
		int f = 0;
		
		int p = S;
		if(i == 1 || (int)log2(l[i]) != (int)log2(l[i - 1]))
			Se.push_back({++cnt, 1}), tree[p][1] = cnt, f = 1, p = cnt;
		
		for (int j = lim2 - f; j >= lim1; j--) {
			if (j == 1) {
				if (!tree[p][ta[j]]) tree[p][ta[j]] = T;
			}
			else if (!tree[p][ta[j]]) {
				tree[p][ta[j]] = ++cnt;
				p = cnt;
			} else p = tree[p][ta[j]];
		}
		if (lim1 > 1) {
			if (mp[lim1 - 1] != 0) {
				mp[lim1] = p;
				tree[p][2] = mp[lim1 - 1];
			} else {
				int tt = 1;
				while (mp[lim1 - tt] == 0) {
					mp[lim1 - tt + 1] = p;
					tree[p][2] = ++cnt;
					p = cnt;
					tt++;
				}
				tree[p][2] = mp[lim1 - tt];
				mp[lim1 - tt + 1] = p;
			}
		}
	}
	cout<<cnt<<endl;
	cout << Se.size() << " ";
	for (int i = 0; i < (int)Se.size(); i++) {
		cout<<Se[i].first<<" "<<Se[i].second<<" ";
	}
	cout<<endl;
	for (int i = 2; i <= cnt; i++) {
		if(tree[i][2]){
			cout<<2<<" "<<tree[i][2]<<" "<<1<<" "<<tree[i][2]<<" "<<0<<endl;
		}
		else if(tree[i][1] && tree[i][0]){
			cout<<2<<" "<<tree[i][1]<<" "<<1<<" "<<tree[i][0]<<" "<<0<<endl;
		}
		else if(tree[i][0]){
			cout<<1<<" "<<tree[i][0]<<" "<<0<<endl;
		}
		else if(tree[i][1]){
			cout<<1<<" "<<tree[i][1]<<" "<<1<<endl;
		}
		else cout<<0<<endl;
	}
}