#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

vector<pii> G[N];

void solve() {
    int l, r; cin >> l >> r;
    int p = 19;
    while (~l >> p & 1 && ~r >> p & 1) --p;
    int idx = 0;
    while (p >= 0 && (l >> p & 1) == (r >> p & 1)) {
        G[idx].emplace_back(idx + 1, l >> p & 1);
        ++idx;
        --p;
    }
    if (p < 0) {
        cout << idx + 1 << el;
        for (int i = 0; i <= idx; ++i) {
            cout << G[i].size() << " \n"[i == idx];
            // cout << G[i].size() << ' ';
            for (int j = 0; j < G[i].size(); ++j) 
                cout << G[i][j].x + 1 << ' ' << G[i][j].y << " \n"[j + 1 == G[i].size()];
        }
        return;
    }
    int t = idx;
    vector<int> all(p + 1);
    ++idx;
    for (int i = p; i >= 0; --i) {
        G[idx].emplace_back(idx + 1, 0);
        G[idx].emplace_back(idx + 1, 1);
        ++idx;
        all[i] = idx;
    }
    int lst = t;
    if (t) {
        G[t].emplace_back(++idx, 0);
        lst = idx;
    }
    for (int i = p - 1; i >= 0; --i) {
        if (~l >> i & 1) {
            G[lst].emplace_back(all[i], 1);
        }
        if (!i) G[lst].emplace_back(all[i], l >> i & 1);
        else {
            if (lst || l >> i & 1) {
                G[lst].emplace_back(idx + 1, l >> i & 1), ++idx;
                lst = idx;
            }
        }
    }
    if (p) G[t].emplace_back(++idx, 1);
    else G[t].emplace_back(idx, 1);
    for (int i = p - 1; i >= 0; --i) {
        if (r >> i & 1) {
            G[idx].emplace_back(all[i], 0);
        }
        if (!i) G[idx].emplace_back(all[i], r >> i & 1);
        else G[idx].emplace_back(idx + 1, r >> i & 1), ++idx;
    }
    vector<int> deg(idx + 1);
    for (int i = 0; i <= idx; ++i) {
        for (auto[j, k]: G[i]) ++deg[j];
    }
    vector<int> nums;
    function<void(int)> dfs = [&](int x) {
        deg[x] = -1;
        for (auto[y, z]: G[x]) if (!--deg[y]) dfs(y);
    };
    for (int i = 1; i <= idx; ++i) {
        if (!deg[i]) dfs(i);
    }
    for (int i = 0; i <= idx; ++i) {
        if (!i || deg[i] > 0) nums.emplace_back(i);
    }
    cout << nums.size() << el;
    auto get = [&](int x) {
        return lower_bound(nums.begin(), nums.end(), x) - nums.begin();
    };
    for (int i = 0; i <= idx; ++i) {
        if (i && deg[i] <= 0) continue;
        cout << G[i].size() << ' ';
        for (int j = 0; j < G[i].size(); ++j) {
            // cout << get(G[i][j].x) + 1 << ' ' << G[i][j].y << " \n"[j + 1 == G[i].size()];
            cout << get(G[i][j].x) + 1 << ' ' << G[i][j].y << ' ';
        }
        cout << el;
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    // cin >> tcase;
    while (tcase--) solve();
}