#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <random>
#include <cstdlib>
#include <numeric>
#include <functional>
#include <queue>
#include <stdlib.h>
#include <map>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;

void slove() {
    int l, r;
    cin >> l >> r;
    int tl = l;
    int tr = r;

    string low, up;
    while (l)
    {
        low.push_back(l % 2);
        l /= 2;
    }
    while (r)
    {
        up.push_back(r % 2);
        r /= 2;
    }

    int s = 1;
    int e = 100;
    vector<int> lary(29);
    vector<int> vis(29);
    vector<vector<pair<int, int>>> edges(101);
    vector<int> upTo(31);
    vector<int> lowTo(31);
    reverse(low.begin(), low.end());
    reverse(up.begin(), up.end());

    upTo[0] = s;
    lowTo[0] = s;
    low = "a" + low;
    up = "a" + up;
    // for (auto ch : low) {
    //     cout << (char)(ch + '0');
    // }
    // return ;
    // cout << endl;


    // 如果前缀相同
    int ls = 1, rs = 1;
    if (up.size() == low.size()) {
        while (ls < low.size() - 1 && up[ls] == low[ls]) {
            edges[s].emplace_back(s + 1, up[ls]);
            upTo[ls] = s;
            lowTo[ls] = s;
            s++;
            ls++;
            rs++;
        }
    }

    int pre = s;
    int nx = s + 1;
    for (int i = ls; i < up.size() - 1; i++) {
        edges[pre].emplace_back(nx, up[i]);
        upTo[i] = pre;
        pre = nx++;
    }
    upTo[up.size() - 1] = pre;
    pre = s;
    for (int i = ls; i < low.size() - 1; i++) {
        edges[pre].emplace_back(nx, low[i]);
        lowTo[i] = pre;
        pre = nx++;
    }
    lowTo[low.size() - 1] = pre;

    e = nx++;

    edges[upTo[up.size() - 1]].emplace_back(e, up[up.size() - 1]);
    if (upTo[up.size() - 1] != lowTo[low.size() - 1] || up[up.size() - 1] != low[low.size() - 1])
    edges[lowTo[low.size() - 1]].emplace_back(e, low[low.size() - 1]);

    for (int i = 1; i < 29; i++) lary[i] = nx++;
    lary[0] = e;

    for (int i = ls; i < up.size(); i++) {
        if (i != ls && up[i] == 1) {
            vis[up.size() - i - 1] = 1;
            edges[upTo[i]].emplace_back(lary[up.size() - i - 1], 0);
        }
        //if (i != ls)
    }

    for (int i = ls; i < low.size(); i++) {
        if (i != ls && low[i] == 0) {
            vis[low.size() - i - 1] = 1;
            edges[lowTo[i]].emplace_back(lary[low.size() - i - 1], 1);
        }
    }

    if (up.size() != low.size()) {
        for (int i = 2; up.size() - i >= low.size(); i++) {
            edges[s].emplace_back(lary[up.size() - i - 1], 1);
            vis[up.size() - i - 1] = 1;
        }
            //edges[upTo[i + 1]].push_back
    }
    int cnt = 0;
    for (int i = 28; i >= 0; i--) {
        if (vis[i]) {
            // cout << i << endl;
            cnt = i;
            break;
        }
    }

    for (int i = 1; i <= cnt; i++) {
        edges[lary[i]].emplace_back(lary[i - 1], 0);
        edges[lary[i]].emplace_back(lary[i - 1], 1);
    }

    cnt = lary[cnt];

    cout << cnt << endl;
    for (int i = 1; i <= cnt; i++) {
        cout << edges[i].size() << " ";
        for (auto nx : edges[i]) {
            cout << nx.first << " " << nx.second << " ";
        }
        cout << endl;
    }


    return;


}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int cnt = 1;
    // cin >> cnt;
    while (cnt--) {
        slove();
    }
    return 0;
}