#include <bits/stdc++.h>

using namespace std;

const int N = 110;
const int LogL = 20;

vector<pair<int, int>> G[N];
set<pair<int, int>> newG[N];
int digit[2][LogL], tot_cnt = 0;
bool merge_head[N], visit[N];
map<int, int> id;

inline void add_edge(int u, int v, int c) { G[u].push_back(make_pair(v, c)); }
void init();
void build_graph();
void build_new_graph();
void dfs_id(int u, int par, int c);
void print();

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    init();
    build_graph();
    build_new_graph();
    print();
    return 0;
}

void init()
{
    int l, r;
    cin >> l >> r;
    for (int i = 0; i < LogL; i++)
    {
        digit[0][i] = l % 2;
        l >>= 1;
    }
    for (int i = 0; i < LogL; i++)
    {
        digit[1][i] = r % 2;
        r >>= 1;
    }
    merge_head[1] = true;
}

void build_graph()
{
    int cnt_v = 1, tmp;
    for (tmp = LogL - 1; tmp >= 0; tmp--)
        if (digit[0][tmp] != digit[1][tmp])
            break;
    for (int i = LogL - 1; i > tmp; i--)
    {
        cnt_v++;
        G[cnt_v - 1].push_back(make_pair(cnt_v, digit[0][i]));
    }
    if (tmp == -1)
        return;
    int div = cnt_v;
    cnt_v++;
    G[div].push_back(make_pair(cnt_v, 0));
    for (int i = tmp - 1; i >= 0; i--)
    {
        cnt_v++;
        G[cnt_v - 1].push_back(make_pair(cnt_v, digit[0][i]));
        if (digit[0][i] == 0)
            G[cnt_v - 1].push_back(make_pair(50 + i, 1));
    }
    cnt_v++;
    G[div].push_back(make_pair(cnt_v, 1));
    for (int i = tmp - 1; i >= 0; i--)
    {
        cnt_v++;
        G[cnt_v - 1].push_back(make_pair(cnt_v, digit[1][i]));
        if (digit[1][i] == 1)
            G[cnt_v - 1].push_back(make_pair(50 + i, 0));
    }
    for (int i = 70; i > 50; i--)
    {
        G[i].push_back(make_pair(i - 1, 1));
        G[i].push_back(make_pair(i - 1, 0));
    }
}

void dfs_id(int u, int par, int c)
{
    if (id.find(u) != id.end())
        return;
    if (G[u].empty())
        return;
    if (u != par && merge_head[par] && c == 0)
    {
        id[u] = id[1];
        merge_head[u] = true;
    }
    else
    {
        tot_cnt++;
        id[u] = tot_cnt;
    }
    for (auto e : G[u])
        dfs_id(e.first, u, e.second);
}

void build_new_graph()
{
    dfs_id(1, 1, 0);
    tot_cnt++;
    for (int i = 1; i < N; i++)
        if (G[i].empty())
            id[i] = tot_cnt;
    for (int i = 1; i < N; i++)
    {
        if (id.find(i) == id.end())
            continue;
        for (auto e : G[i])
            if (id[i] != id[e.first])
            {
                // cout << i << " " << e.first << endl;
                // cout << "add edge " << id[i] << " " << id[e.first] << " " << e.second << endl;
                newG[id[i]].insert(make_pair(id[e.first], e.second));
            }
    }
}

void print()
{
    cout << tot_cnt << endl;
    for (int i = 1; i <= tot_cnt; i++)
    {
        cout << newG[i].size() << " ";
        for (auto e : newG[i])
            cout << e.first << " " << e.second << " ";
        cout << endl;
    }
}