#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define debugging 0
const int maxn = 1000010;
//const int maxm = 500010;
#define pii pair<int, int>
#define f first
#define s second
#define mp make_pair

int n, m;
int x, y;
int tot;
vector<pii> ve[maxn];
vector<int> bits;

int cal(int l, int r) {
	if (l >= x && r <= y) {
		int len = r - l;
		
		int sz = bits.size();
		int i = 0; // AC
//		int i = min(max(sz - 1, 0), 22); // WA 
//		int i = min(max(sz - 10, 0), 22); // WA 
//		int i = min(max(int(bits.size()) - 1, 0), 22);
		for (; (1 << i) < len; ++i) {
			if (i + 1 == (int)bits.size()) {
				++tot;
				ve[tot].push_back(mp(bits.back(), 0));
				ve[tot].push_back(mp(bits.back(), 1));
				bits.push_back(tot);
			}
		}
		return bits[i];
	}
	int id = ++tot;
	int mid = (l + r) / 2;
	if (x < mid) {
		ve[id].push_back(mp(cal(l, mid), 0));
	}
	if (mid < y) {
		ve[id].push_back(mp(cal(mid, r), 1));
	}
	return id;
}

void solve() {
	scanf("%d%d", &x, &y);
	++y; // [x, y)
	tot = 2;
	bits.push_back(2);
	for (int i = 0; (1 << i) < y; ++i) {
		if (x >= (1 << i + 1)) {
			continue;
		}
		int id = cal(1 << i, 1 << i + 1); // [2^i, 2^(i+1))
		ve[1].push_back(mp(id, 1));
	}
	
	printf("%d\n", tot);
	for (int i = 1; i <= tot; ++i) {
		printf("%d", ve[i].size());
		for (auto p: ve[i]) {
			printf(" %d %d", p.f, p.s);
		}
		printf("\n");
	}
	
} 

int main() {
//	printf("%d VS %d -- %d\n", 1 << 3 + 1, 1 << (3 + 1), (1 << 3) + 1);
    int tt = 1;
//    IOS
//    cin >> tt;
//    scanf("%d", &tt);
    while (tt--) {
        solve();
    }
    
    return 0;
}
/*


*/