#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
#define int long long
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
vector<vector<pair<int, int>>> ans(105);
int idx = 2;
int ma = 0;
int z1 = 1, z2 = 2;
int l, r;
vector<vector<pair<int, int>>> p(105);

void dfs(int u, int num, int fa) {
    if (num == 0)return;
    if (u >= l && u + (1 << num) - 1 <= r) {
        p[fa].push_back({num, 1});
        p[fa].push_back({num, 0});
        ma = max(ma, num);
        return;
    }
    if (u + (1 << (num - 1)) - 1 >= l) {
        if (num == 1) {
            ans[fa].push_back({z2, 0});
        } else {
            ans[fa].push_back({++idx, 0});
            dfs(u, num - 1, idx);
        }
    }
    if (u + (1 << (num - 1)) <= r) {
        if (num == 1) {
            ans[fa].push_back({z2, 1});
        } else {
            ans[fa].push_back({++idx, 1});
            dfs(u + (1 << (num - 1)), num - 1, idx);
        }
    }
}

void solve() {
    cin >> l >> r;
    if (l == 1) {
        ans[1].push_back({2, 1});
    }
    for (int i = 1; i <= 19; i++) {
        int y = (1ll << i);
        if (y >= l && 2 * y - 1 <= r) {
            ma = max(i, ma);
            ans[1].push_back({++idx, 1});
            p[idx].push_back({i, 1});
            p[idx].push_back({i, 0});
        } else if ((2 * y - 1 >= l && 2 * y - 1 <= r) || (l <= y && y <= r)) {
            ans[1].push_back({++idx, 1});
            dfs(1 << i, i, idx);
        } else if (y <= l && 2 * y - 1 >= r) {
            ans[1].push_back({++idx, 1});
            dfs(1 << i, i, idx);
            break;
        }
    }
    vector<int> j(ma + 5);
    j[1] = z2;
    for (int i = 2; i <= ma; i++) {
        j[i] = ++idx;
    }
    for (int i = 2; i <= ma; i++) {
        ans[j[i]].push_back({j[i - 1], 1});
        ans[j[i]].push_back({j[i - 1], 0});
    }
    for (int i = 1; i <= idx; i++) {
        for (int j1 = 0; j1 < p[i].size(); j1++) {
            auto y = p[i][j1];
            ans[i].push_back({j[y.first], y.second});
        }
    }
    cout << idx << '\n';
    for (int i = 1; i <= idx; i++) {
        cout << ans[i].size() << " ";
        for (int j1 = 0; j1 < ans[i].size(); j1++) {
            auto y = ans[i][j1];
            cout << y.first << " " << y.second << " ";
        }
        cout << '\n';
    }


}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}