#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()

bool chmin(auto &a, auto b) { return (b < a) and (a = b, true); }
bool chmax(auto &a, auto b) { return (a < b) and (a = b, true); }

using i64 = long long;

constexpr i64 inf = 1E18;

const int kN = 1E5;
int trie[kN][2]{};
int id[kN]{};
int dep[kN];
int bel[kN];
bool lef[kN];
int top = 1;

void solve() {
    int L, R;
    cin >> L >> R;

    const int root = top++;
    // 0 ~ 19
    int g = 1;
    id[root] = g;

    auto insert = [&](i64 x, int s) -> int {
        int p = root;
        int f = false;
        for (int i = 20; i >= 0; i--) {
            int d = (x >> i) & 1;
            if (!trie[p][d]) {
                trie[p][d] = top++;
            }
            p = trie[p][d];
            bel[p] |= s;
            if (d) {
                f = true;
            }
            if (!f and s == 1) {
                id[p] = g;
            }
            dep[p] = i;
        }
        lef[p] = 1;
        return p;
    };

    insert(L, 1);
    insert(R, 2);

    for (int i = 1; i < top; i++) {
        if (dep[i] == 0 or id[i]) {
            continue;
        }
        id[i] = ++g;
    }

    int h = 0;
    for (int i = root; i < top; i++) {
        if (bel[i] == 1) {
            if (trie[i][0] != 0) {
                trie[i][1] = top++;
                id[trie[i][1]] = dep[i] - 1;
                lef[trie[i][1]] = 1;
                chmax(h, dep[i] - 1);
            }
        } else if (bel[i] == 2) {
            if (trie[i][1] != 0) {
                trie[i][0] = top++;
                id[trie[i][0]] = dep[i] - 1;
                lef[trie[i][0]] = 1;
                chmax(h, dep[i] - 1);
            }
        }
    }
    // cerr << " h = " << h << '\n';

    vector G(g + h + 1, vector<pair<int, int>>{});
    // 0 ~ h
    // h + 1 ~ h + g
    for (int i = 1; i <= h; i++) {
        G[i].push_back({i - 1, 0});
        G[i].push_back({i - 1, 1});
    }
    for (int i = root; i < top; i++) {
        int a = id[i] + (lef[i] ? 0 : h);
        for (int j : {0, 1}) {
            int x = trie[i][j];
            int b = id[x] + (lef[x] ? 0 : h);
            if (x and a != b) {
                G[a].push_back({b, j});
            }
        }
    }

    cout << G.size() << '\n';
    for (auto v : G) {
        cout << v.size();
        for (auto [a, b] : v) {
            cout << ' ' << a + 1 << ' ' << b;
        }
        cout << '\n';
    }
}


signed main() {
    cin.tie(0)->sync_with_stdio(false);
    cin.exceptions(cin.failbit);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}