#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <stack>
#include <cmath>
using namespace std;
typedef pair<int, int> PII;
const int N = 100;
PII pa[N];
vector<PII> ans[N];
int idx;

int max_lg(int num) {
    return (int)log2((pa[num].second ^ pa[num].first) + 1);
}

PII seperate_section(int l, int r) {
    int num1 = 1, num2 = 0;
    pa[1] = { l, l };
    int max_suf = 0;
    for (int i = 2; ; i++, num1++) {
        int x = pa[i - 1].second + 1;
        int y = x | pa[i - 1].second;
        if (y > r) break;
        //cout << x << ' ' << y << endl;
        pa[i] = { x, y };
    }
    max_suf = max(max_suf, max_lg(num1));
    if (pa[num1].second ^ r) {
        pa[++num1] = { r, r };
        num2 = num1;
        for (int i = num1 + 1; ; i++, num1++) {
            int x = pa[i - 1].first - 1;
            int y = x & pa[i - 1].first;
            if (y < l) break;
            //cout << y << ' ' << x << endl;
            pa[i] = { y, x };
        }
        max_suf = max(max_suf, max_lg(num1));
    }
    max_suf++;
    for (int i = 2; i <= max_suf; i++) {
        ans[i].push_back({ i - 1, 0 });
        ans[i].push_back({ i - 1, 1 });
    }
    idx = max_suf;
    return { num1, num2 };
}

stack<int> dec_bin(int x) {
    stack<int> ans;
    while (x) {
        ans.push(x % 2);
        x /= 2;
    }
    return ans;
}

void make_graph(PII num) {
    int x = num.first, y = num.second;
    int start = ++idx;
    if (y) {
        int tmp = pa[y].first;
        stack<int> stk = dec_bin(tmp);
        ans[start].push_back({ ++idx, 1 });
        stk.pop();
        vector<PII> vec;
        while (!stk.empty()) {
            int tp_val = stk.top();
            if (tp_val) {
                vec.push_back({ idx, stk.size() });
            }
            ans[idx].push_back({ stk.size() == 1 ? 1 : ++idx, tp_val });
            stk.pop();
        }
        int tmp1 = x;
        for (int i = vec.size() - 1; tmp1 > y; i--, tmp1--) {
            ans[vec[i].first].push_back({ vec[i].second, 0 });
        }
    }

    y = y ? y : x + 1;
    int tmp = pa[1].first;
    stack<int> stk = dec_bin(tmp);
    int stk_si = stk.size() + 1;
    vector<PII> vec;
    while (!stk.empty()) {
        int tp_val = stk.top();
        if (!tp_val) vec.push_back({ idx, stk.size() });
        if (stk.size() == stk_si - 1) {
            ans[start].push_back({ stk.size() == 1 ? 1 : ++idx, tp_val });
        } else {
            ans[idx].push_back({ stk.size() == 1 ? 1 : ++idx, tp_val });
        }
        
        stk.pop();
    }
    y--;
    if (vec.size() >= y) {
        y--;
        for (int i = vec.size() - 1; y > 0; i--, y--) {
            ans[vec[i].first].push_back({ vec[i].second, 1 });
        }
    } else {
        for (int i = 0; i < vec.size(); i++) {
            ans[vec[i].first].push_back({ vec[i].second, 1 });
        }
        for (int i = vec.size() + 1; i < y; i++) {
            ans[start].push_back({ stk_si++, 1 });
        }
    }
}

void out_ans() {
    printf("%d\n", idx);
    for (int i = 1; i <= idx; i++) {
        printf("%d", ans[i].size());
        for (auto x : ans[i]) {
            printf(" %d %d", x.first, x.second);
        }
        puts("");
    }
}

void solve() {
    int l, r;
    scanf("%d%d", &l, &r);
    auto num = seperate_section(l, r);

    make_graph(num);

    out_ans();
}

int main() {
    solve();
    return 0;
}