#include <bits/stdc++.h>
#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

const int NO = 1000;

vector<pair<pair<int, int>, int>> e;
int n1 = 0;
int n2 = 1;

int go(int l, int r, int d) {
    if (r < l) return NO;
    assert((l & (1 << d)) == (r & (1 << d)));
    l = l & ((1 << d) - 1);
    r = r & ((1 << d) - 1);
//    cout << l << " " << r << " " << d << "\n";
    if (l == 0 && (r == (1 << d) - 1)) {
        n2 = max(n2, d + 1);
        return -d;
    }
    int x = 2 + n1;
    n1++;
    int m = 1 << (d - 1);
    int y = go(l, min(m - 1, r), d - 1);
    if (y != NO) {
        e.push_back({{x, y}, 0});
    }
    y = go(max(m, l), r, d - 1);
    if (y != NO) {
        e.push_back({{x, y}, 1});
    }
    return x;
}

int main() {
    ios::sync_with_stdio(false);

    int l, r;
    cin >> l >> r;
    for (int d = 1; d <= 20; d++) {
        int ll = 1 << (d - 1);
        int rr = (1 << d) - 1;
        int x = go(max(l, ll), min(r, rr), d - 1);
        if (x != NO) {
            e.push_back({{1, x}, 1});
        }
    }
    int n = n1 + n2 + 1;
    vector<vector<pair<int, int>>> g(n + 1);
    for (auto [ee, w] : e) {
        auto [x, y] = ee;
        if (y <= 0) y = 2 + n1 + (-y);
        g[x].push_back({y, w});
    }
    for (int i = 0; i < n2 - 1; i++) {
        g[n - i].push_back({n - i - 1, 0});
        g[n - i].push_back({n - i - 1, 1});
    }
    cout << n << "\n";
    for (int i = 1; i <= n; i++) {
        cout << g[i].size() << " " ;
        for (auto [y, w] : g[i]) {
            cout << y << " " << w << " ";
        }
        cout << "\n";
    }


    return 0;
}