#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000010;
int n, m;
int cnt = 2, root = 1, ed = 2;
vector<pair<int, int> > e[N];
int mx = 0;
vector<pair<int, int> > points;

void solve(int l, int r, int L, int R, int cur, int u) {
	assert(L <= R);
	// cout << ">>> solve : " << l << " " << r << " " << L << " " << R << " " << cur << "\n"; 
	if(cur == 0) {
		if(L == R) e[u].push_back({ed, L & 1});
		else {
			e[u].push_back({ed, 0});
			e[u].push_back({ed, 1});
		}
		return ;
	}
	if(l == L && r == R) {
		int x = r - l + 1, w = 0;
		for(; x; x /= 2, w++);
		points.push_back({u, w});
		mx = max(mx, w);
		return ;
	}
	int mid = (l + r) >> 1;
	if(L <= mid) {
		int v = ++cnt;
		e[u].push_back({v, 0});
		solve(l, mid, L, min(R, mid), cur - 1, v);
	}
	if(R > mid) {
		int v = ++cnt;
		e[u].push_back({v, 1});
		solve(mid + 1, r, max(mid + 1, L), R, cur - 1, v);
	}
}
int main() {
	ios::sync_with_stdio(0); cin.tie(nullptr);
	cin >> n >> m;
	if(n == 1) {
		e[root].push_back({ed, 1});
	}
	for(int i = 1; (1 << i) <= m; i++) {
		int l = (1 << i), r = (1 << (i + 1)) - 1;
		if(r < n || l > m) continue;
		++cnt, e[root].push_back({cnt, 1});
		solve(l, r, max(n, l), min(m, r), i - 1, cnt);
	}
	if(mx) {
		--mx;
		for(int i = 1; i < mx - 1; i++) {
			e[cnt + i * 2 - 1].push_back({cnt + (i + 1) * 2 - 1, 0});
			e[cnt + i * 2 - 1].push_back({cnt + (i + 1) * 2, 1});
			e[cnt + i * 2].push_back({cnt + (i + 1) * 2 - 1, 0});
			e[cnt + i * 2].push_back({cnt + (i + 1) * 2, 1});
		}
		if(mx != 1) {
			e[cnt + (mx - 1) * 2 - 1].push_back({ed, 0});
			e[cnt + (mx - 1) * 2 - 1].push_back({ed, 1});
			e[cnt + (mx - 1) * 2].push_back({ed, 0});
			e[cnt + (mx - 1) * 2].push_back({ed, 1});
		}
	}
	for(auto v : points) {
		--v.second;
		if(v.second == 1) {
			e[v.first].push_back({ed, 0});
			e[v.first].push_back({ed, 1});
		}
		else {
			e[v.first].push_back({cnt + (mx - v.second + 1) * 2 - 1, 0});
			e[v.first].push_back({cnt + (mx - v.second + 1) * 2, 1});
		}
	}
	if(mx) cnt += (mx - 1) * 2;
	cout << cnt << "\n";
	for(int i = 1; i <= cnt; i++) {
		cout << e[i].size() << " ";
		for(auto v : e[i]) cout << v.first << " " << v.second << " ";
		cout << "\n";
	}
	return 0;
}