#include <bits/stdc++.h>

template < typename T >
inline void read(T &cnt) {
    cnt = 0; char ch = getchar(); bool op = 1;
    for (; ! isdigit(ch); ch = getchar())
        if (ch == '-') op = 0;
    for (; isdigit(ch); ch = getchar())
        cnt = cnt * 10 + ch - 48;
    cnt = op ? cnt : - cnt;
}


const int N = 200;
int max = 0;
std::vector < std::pair < int, int > > V[N], V2[N];
int change[N], Ichange[N], exi2[N];

inline void ADD(int u, int v, int x) {
    exi2[u] = 1, exi2[v] = 1;
    max = std::max(max, std::max(u, v));
    V[u].push_back(std::make_pair(v, x));
    // std::cout << u << ' ' << v << ' ' << x << '\n';
}
bool exi[200];
int nxt[N * N], head[N], to[N * N], val[N * N], In[N], TOT;
inline void add(int u, int v, int x) {
    nxt[++ TOT] = head[u];
    head[u] = TOT;
    to[TOT] = v;
    val[TOT] = x;
    In[v] ++;
    // std::cout << u << ' ' << v << ' ' << x << '\n';
}
int fir, FIR;
int EDGE[200][200][2];
inline void EXadd(int u, int v, int x) {
    if (EDGE[u][v][x]) return;
    EDGE[u][v][x] = 1;
    exi2[u] = 1, exi2[v] = 1;
    max = std::max(max, std::max(u, v));
    V2[u].push_back(std::make_pair(v, x));
    // std::cout << u << ' ' << v << ' ' << x << '\n';
}

inline void search(int u, int exist) {
    for (int i = head[u]; i; i = nxt[i]) {
        int v = to[i];
        // std::cout << v << 'q';
        if (val[i] == 1) {
            if (exist == 0) EXadd(FIR, v, 1);
            else EXadd(u, v, 1);
            search(v, 1);
        }
        else {
            if (exist == 0) search(v, 0);
            else EXadd(u, v, 0), search(v, 1);
        }
    }
}
int size;

inline void solve() {
    memset(exi2, 0, sizeof(exi2));
    max = 0;
    int fir = 0;
    for (int i = 1; i <= size; ++ i) {
        if (In[i] == 0) fir = i, FIR = i;
    }
    // std::cout << "JKDSA" << fir << '\n';
    search(fir, 0);

    int tot = 0;
    for (int i = 1; i <= 100; ++ i) {
        if (exi2[i]) {
            change[i] = ++ tot;
            Ichange[tot] = i;
        }
    }
    std::cout << tot << '\n';
    for (int i = 1; i <= tot; ++ i) {
        int siz = V2[Ichange[i]].size();
        std::cout << siz << ' ';
        for (int j = 0; j < siz; ++ j) {
            // add(i, change[V[Ichange[i]][j].first], V[Ichange[i]][j].second);
            std::cout << change[V2[Ichange[i]][j].first] << ' ' << V2[Ichange[i]][j].second << ' ';
        }
        std::cout << '\n';

    }
}
int main()
{   
    int l, r;
    read(l), read(r);

    if (l == r) {
        int x = 0;
        for (int i = 22; i >= 0; -- i)
            if ((l >> i) & 1) {
                x = i;
                break;
            }
        for (int i = x; i >= 0; -- i) {
            if ((l >> i) & 1) {
                ADD(i + 2, i + 1, 1);
            }
            else ADD(i + 2, i + 1, 0);
        }
    }
    else {
        int x = 25, x2 = 0, x3;
    for (int i = 22; i >= 0; -- i) {
        if ((((l >> i) & 1) == 0) && (((r >> i) & 1) == 1)) {
            x2 = i; x3 = x;
            break;
        }
        if ((((l >> i) & 1) == 1) && (((r >> i) & 1) == 1)) {
            ADD(x, x + 1, 1);
            x ++;
        }
        if ((((l >> i) & 1) == 0) && (((r >> i) & 1) == 0)) {
            ADD(x, x + 1, 0);
            x ++;
        }
    }
    for (int i = x2; i > 0; -- i) {
        if (((l >> i) & 1) == 0) {
            if (i == x2) {
                ADD(x, x + 1, 0);
                x += 1;
            }
            else {
                ADD(x, i + 1, 1);
                exi[i + 1] = 1;
                ADD(x, x + 1, 0);
                x ++;
            }
        }
        else {
            ADD(x, x + 1, 1);
            x ++;
        }
    }

    if (l & 1) {
        ADD(x, 1, 1);
    }
    else {
        ADD(x, 1, 1);
        ADD(x, 1, 0);
    }

    for (int i = x2; i > 0; -- i) {
        if (((r >> i) & 1) == 0) {
            if (i == x2) {
                ADD(x3, x + 1, 0);
                x ++;
            }
            else {
                ADD(x, x + 1, 0);
                x ++;
            }
        }
        else {
            if (i == x2) {
                ADD(x3, x + 1, 1);
                x ++;
            }
            else {
                ADD(x, i + 1, 0);
                exi[i + 1] = 1;
                ADD(x, x + 1, 1);
                x ++;
            }
        }
    }

    if (r & 1) {
        ADD(x, 1, 0);
        ADD(x, 1, 1);
    }
    else {
        ADD(x, 1, 0);
    }

    for (int i = 21; i >= 1; -- i) {
        if (exi[i]) {
            for (int j = i; j >= 2; -- j) {
                ADD(j, j - 1, 0), ADD(j, j - 1, 1);
            }
            break;
        }
    }
    }
    int tot = 0;
    for (int i = 1; i <= 100; ++ i) {
        if (exi2[i]) {
            change[i] = ++ tot;
            Ichange[tot] = i;
        }
    }
    size = tot;
    // std::cout << tot << '\n';
    for (int i = 1; i <= tot; ++ i) {
        int siz = V[Ichange[i]].size();
        // std::cout << siz << ' ';
        for (int j = 0; j < siz; ++ j) {
            add(i, change[V[Ichange[i]][j].first], V[Ichange[i]][j].second);
            // std::cout << change[V[Ichange[i]][j].first] << ' ' << V[Ichange[i]][j].second << ' ';
        }
        // std::cout << '\n';

    }

    solve();
    return 0;
}