#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return 1ll * a * b / gcd(a, b); }
ll divCeil(ll x, ll y) { return x / y + (x % y != 0); }
const int MAXN = 2e5 + 5;
const double pi = 3.14159265358979323846;
const ll inf = 1e18;
double eps = 1e-9;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
#define endl "\n"
vector <vector<pair<int, int>>>g(maxn);
vector<int>mp(25);//2的多少次方的下标
vector<vector<int>>ch(maxn, vector<int>(2));
int cnt = 1;
int lowbit(int i)
{
    return i & -i;//或者是return i-(i&(i-1));表示求数组下标二进制的非0最低位所表示的值
}
void solve() {
    int l, r;
    cin >> l >> r;
    int tmp = l;
    auto getPos = [&](int x) {
        
        for (int j = 20; j >= 0; j--) {
            if (x >> j & 1) {
                return j;
            }
        }
        return 0;
    };
    while (l <= r) {
        int add = lowbit(l);
        while (l + add - 1 > r)add /= 2;

        int R  =l +  add - 1;
        int p = 0;
        int len = 0;
        p = getPos(add);
        len = getPos(l);
        int cur = 1;
        for (int j = len; j > p ; j--) {
            int bit = l >> j & 1;
            if (!mp[p] && ch[cur][bit])cur = ch[cur][bit];
            else if (!ch[cur][bit]) {
                ch[cur][bit] = ++cnt;
                g[cur].push_back({ cnt,bit });
                cur = cnt;
            }
            else cur = ch[cur][bit];
        }
        int bit = (l >> (p) & 1);
        
        if (!mp[p]) {
            int now = ++cnt;
            mp[p] = now;
            for (int i = p - 1; i >= 0; i--) {
                if (!mp[i]) {
                    int nxt = ++cnt;
                    g[now].push_back({ nxt,0 });
                    g[now].push_back({ nxt,1 });
                    mp[i] = nxt;
                    now = nxt;
                }
                else {
                    g[now].push_back({ mp[i],0});
                    g[now].push_back({ mp[i ],1 });
                    break;
                }
                

            }
        }
        
        g[cur].push_back({mp[p],bit});
        l = R + 1;
        //cout << l << endl;
    }
    cout << cnt << endl;
    for (int i = 1; i <= cnt; i++) {
        cout << g[i].size() << " ";
        for (auto x : g[i])cout << x.first << " " << x.second << " ";
        cout << endl;
    }
    return;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    solve();
    return 0;
}