#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 100 + 10;

vector<int> master_id;

struct Node {
    int ch[2] = {0, 0};
} t[maxn];

int tot;

int read() {
    int res = 0, p = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-')
            p = -1;
        ch = getchar();
    }
    while (isdigit(ch))
        res = res * 10 + ch - '0', ch = getchar();
    return res * p;
}

int high_bit(int x) {
    int res = 0;
    for (int i = 0; x; i++) {
        if (x & 1)
            res = i;
        x >>= 1;
    }
    return res;
}

bool is_power(int x) {
    return (x & (x - 1)) == 0;
}

int get_master(int pos) {
    if (master_id.size() - 1 < pos) {
        for (int i = master_id.size(); i <= pos; i++) {
            ++tot;
            t[tot].ch[0] = t[tot].ch[1] = master_id[i - 1];
            master_id.push_back(tot);
        }
    }
    return master_id[pos];
}

void solve(int l, int r, int pos, int id) {
    int lv = l >> pos & 1;
    int rv = r >> pos & 1;
    if (pos == 0) {
        t[id].ch[lv] = t[id].ch[rv] = get_master(pos);
        return;
    }
    if (lv == rv) {
        t[id].ch[lv] = ++tot;
        if (lv)
            solve(l - (1 << pos), r - (1 << pos), pos - 1, tot);
        else
            solve(l, r, pos - 1, tot);
    } else {
        if (l == 0) {
            t[id].ch[0] = get_master(pos);
            t[id].ch[1] = ++tot;
            solve(0, r - (1 << pos), pos - 1, tot);
        } else if (r == (1 << (pos + 1)) - 1) {
            t[id].ch[0] = ++tot;
            solve(l, (1 << pos) - 1, pos - 1, tot);
            t[id].ch[1] = get_master(pos);
        } else {
            t[id].ch[0] = ++tot;
            solve(l, (1 << pos) - 1, pos - 1, tot);
            t[id].ch[1] = ++tot;
            solve(0, r - (1 << pos), pos - 1, tot);
        }
    }
}

vector<int> path, tmp;

void dfs(int u, int val) {
    if (u == 2) {
        path.push_back(val);
        return;
    }
    for (int i = 0; i < 2; i++)
        if (t[u].ch[i])
            dfs(t[u].ch[i], val * 2 + i);
    if (u == 1)
        for (int id : tmp)
            dfs(id, val * 2 + 1);
}

int main() {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int l = read(), r = read();
    master_id.push_back(2); // 叶子
    tot = 2;
    solve(l, r, high_bit(r), 1);

    // 压缩前导零
    int len = 0, cur = 1;
    while (t[cur].ch[0] != 0) {
        len++;
        int id = t[cur].ch[0];
        t[cur].ch[0] = 0;
        cur = id;
        if (t[cur].ch[1])
            tmp.push_back(t[cur].ch[1]);
    }

    dfs(1, 0);
    sort(path.begin(), path.end());
    // cout << "----" << path.size() << endl;
    // for (int val : path)
    //     cout << val << endl;
    cout << tot - len << endl;
    for (int i = 1; i <= tot; i++) {
        if (i > 2 && i <= 2 + len)
            continue;
        int cnt = (t[i].ch[0] != 0) + (t[i].ch[1] != 0);
        if (i == 1)
            cnt += tmp.size();
        // cout << "----" << i << ' ';
        cout << cnt << ' ';
        for (int j = 0; j < 2; j++) {
            if (t[i].ch[j]) {
                if (t[i].ch[j] == 2)
                    cout << t[i].ch[j] << ' ' << j << ' ' ;
                else
                    cout << t[i].ch[j] - len << ' ' << j << ' ' ;
            }
        }
        if (i == 1) {
            for (int id : tmp) {
                if (id == 2)
                    cout << id << ' ' << 1 << ' ' ;
                else
                    cout << id - len << ' ' << 1 << ' ' ;
            }
        }
        cout << endl;
    }
    return 0;
}