#include <bits/stdc++.h>
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef __int128 LLL;
typedef std::pair<int, int> pii;
typedef std::pair<int, LL> pil;
typedef std::pair<LL, int> pli;
typedef std::pair<LL, LL> pll;
#define fi first
#define se second
#define MP std::make_pair
LL read()
{
	LL s = 0; int f = 1;
	char c = getchar();
	while (!(c >= '0' && c <= '9'))
		f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9')
		s = s * 10 + (c ^ 48), c = getchar();
	return f ? s : -s;
} 
template<typename T> void write(T x, char end = '\n')
{
	static int d[100], cur = 0;
	do{ d[++cur] = x % 10; } while (x /= 10);
	while (cur) putchar('0' + d[cur--]);
	putchar(end);
}
const int MAXN = 100005, inf = 0x3f3f3f3f, MAXV = 1000006, MAXP = 400005, MAXS = 6000006, V = 59;
const LL INF = 0x1f3f3f3f3f3f3f3fll;
const int MOD = 998244353;
auto fplus = [](int x, int y){ return x + y >= MOD ? x + y - MOD : x + y; };
auto fminus = [](int x, int y){ return x >= y ? x - y : x + MOD - y; };
auto Fplus = [](int &x, int y){ return x = fplus(x, y); };
auto Fminus = [](int &x, int y){ return x = fminus(x, y); };
template<typename T> T& Fmax(T& x, T y){ return x = x < y ? y : x; };
template<typename T> T& Fmin(T& x, T y){ return x = x < y ? x : y; };
int L, R, n, m, id[100];
std::vector<pii> e[MAXN];
int tran(int x, int o)
{
	for (pii p : e[x])
		if (o == p.se) return p.fi;
	e[x].emplace_back(++n, o); return n;
}
void dfs(int x, int l, int r, int d, bool zero)
{
	if (!l && r == (1 << (d + 1)) - 1)
	{
		for (; m <= d; m++)
			id[m] = ++n, e[id[m]].emplace_back(id[m - 1], 0), e[id[m]].emplace_back(id[m - 1], 1);
		e[x].emplace_back(id[d], 0), e[x].emplace_back(id[d], 1);
		return ;
	}
	if (!d) return e[x].emplace_back(id[0], l), void();
	int lo = l >> d & 1, ro = r >> d & 1;
	int ll = l ^ (lo << d), rr = r ^ (ro << d);
	if (lo == ro)
	{
		if (lo || !zero) e[x].emplace_back(++n, lo), dfs(n, ll, rr, d - 1, 0);
		else dfs(x, ll, rr, d - 1, 1);
	}
	else
	{
		int mid = (1 << d) - 1;
		if (zero) dfs(x, ll, mid, d - 1, 1);
		else e[x].emplace_back(++n, 0), dfs(n, ll, mid, d - 1, 0);
		e[x].emplace_back(++n, 1), dfs(n, 0, rr, d - 1, 0);
	}
}
int main()
{
	L = read(), R = read();
	n = 2, m = 1, id[0] = 2, dfs(1, L, R, 19, 1);
	printf("%d\n", n);
	for (int i = 1; i <= n; i++)
	{
		printf("%d ", e[i].size());
		for (pii p : e[i]) printf("%d %d ", p.fi, p.se);
		putchar('\n');
	}
	return 0;
}