#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define pii pair<int, int>
const ll inf = 1145141919810;
using namespace std;
const int N = 1e6 + 7;
vector<pii> g[N + 1];
int tot = 30;
int s = 100;
int in[N], pos[N];

const int M = 40;
int id[N];
void print() {
    int cnt = 0;
    for(int i = 30; i >= 1; --i) {
        if(in[i] >= 1) {
            for(int j = i - 1; j >= 1; --j) {
                g[j + 1].push_back({j, 1});
                g[j + 1].push_back({j, 0});
            }
            break;
        }
    }


    for(int i = 100; i >= 1; --i) {
        if(g[i].size() || i == 1) {
            id[++cnt] = i;
            pos[i] = cnt;
        }
    }

    // for(int i = 1; i <= cnt; ++i) {
    //     cout << id[i] << endl;
    // }

    cout << cnt << endl;
    for(int i = 1; i <= cnt; ++i) {
        // cout << "id_i = " << id[i] << endl;
        cout << g[id[i]].size() << " ";
        for(auto[x, y] : g[id[i]]) {
            cout << pos[x] << " " << y << " ";
        }
        cout << endl;
    }
    
}
void pprint(){
    for(int i = 1; i <= 100; ++i) {
        if(g[i].size()) {
            cout << "i = " << i << endl;
            for(auto [x, y]:g[i]) {
                cout << x << " " << y << endl;
            }
        }
    }
}
void slv(){
    ll l, r;
    cin >> l >> r;
    // int tot = 0;
    
    int w = -1, F = 0;
    for(int j = M; j >= 0; --j) {
        if(r >> j & 1) {//最高位是j
            if(l >> j & 1) {
                if(j == 0) g[s].push_back({1, 1});
                else g[s].push_back({++tot, 1});
                s = tot;
            } else {
                //分叉
                w = j;//在第j位分叉
                break;
            }
            F = 1;
        } else {
            if(F == 1) {
                g[s].push_back({++tot, 0});
                s = tot;
            }
        }
    }

    // cout << "s = " << s << endl;

    if(w == -1) {//没有分叉 只有一个数
        print();
        return ;
    }
    
    if(w == 0) {
        // cout << "S = " << s << endl;
        g[s].push_back({1, 0});
        g[s].push_back({1, 1});
        print();
        return ;
    }

    // cout << "w = " << w << endl;

    //1的部分

    int now = s;
    g[now].push_back({++tot, 1});
    now = tot;

    for(int i = w - 1; i >= 1; --i) {
        if(r >> i & 1) {//0是满的
            g[now].push_back({i + 1, 0});
            in[i + 1] = 1;
            g[now].push_back({++tot, 1});
            now = tot;
        } else {
            g[now].push_back({++tot, 0});
            now = tot;
        }
    }

    // cout << "now = " << now << endl;
    if(r >> 0 & 1) {
        g[now].push_back({1, 0});
        g[now].push_back({1, 1});
    } else {
        g[now].push_back({1, 0});
    }

    // cout << "now = " << now << endl;
    int f = (s == 100 ? 0 : 1);
    now = s;//搞是0的部分
    if(f) {
        g[now].push_back({++tot, 0});
        now = tot;
    }

    // cout << "now = " << now << endl;
    // cout << "f = " << f << endl;
    for(int i = w - 1; i >= 1; --i) {
        if(!(l >> i & 1)) {//1是满的
            // cout << "1_now = " << now << endl;
            g[now].push_back({i + 1, 1});
            in[i + 1] = 1;

            if(f) {
                g[now].push_back({++tot, 0});
                now = tot;
            }
        } else {
            g[now].push_back({++tot, 1}); 
            f = 1;
            now = tot;
        }
    }
    // cout << "now = " << now << endl;
    if(!(l >> 0 & 1)) {
        g[now].push_back({1, 1});
        g[now].push_back({1, 0});
    } else {
        g[now].push_back({1, 1});
    }
    // pprint();
    print();
    // pprint();
}

int main(){
    //ios::sync_with_stdio(0), cin.tie(0);
    int _ = 1;
    //cin >> _;
    while(_--) slv();
    return 0;
}
/*
5 7
*/
/*
3 7
*/
/*

1111 0100 0010 0100 0000
0000 0000 0000 0000 0001

*/