#include <bits/stdc++.h>
using namespace std;
#define re
#define ll long long
#define in inline
#define int ll
const int _ = 101;
const int maxn = 20;
int L, R, lb[_], rb[_], lenl, lenr;
namespace case1 {  // L==R
void out(int x) {
    if (x == 1) {
        cout << 1 << ' ' << 2 << ' ' << lb[0] << endl;
        return;
    }
    out(x - 1);
    cout << 1 << ' ' << x + 1 << ' ' << lb[x - 1] << endl;
}
void solve() {
    int tot = 2;
    cout << tot + lenl << endl;
    cout << 1 << ' ' << lenl + 2 << ' ' << 1 << endl;
    cout << 0 << endl;
    if (L != 1) out(lenl);
}
}  // namespace case1

int mp[_][_], mp2[_][_], idl[_], idr[_], idb[_], tot = 2, cntl, cntr, cntb;
namespace case2 {
void solve() {
    int now = 0;
    for (int i = lenl; i >= 0; i--)
        if (lb[i] != rb[i]) {
            now = i;
            break;
        }
    for (int i = now - 1; i >= 0; i--)
        if (lb[i] == 0 || rb[i] == 1) {
            cntb = i;
            break;
        }
    for (int i = 1; i <= cntb; ++i) idb[i] = ++tot;
    for (int i = 1; i < now; ++i) {
        if (lb[i] == 0) mp[idl[i + 1]][idb[i]] = 1;
        if (rb[i] == 1) mp[idr[i + 1]][idb[i]] = 0;
    }
    if (R - L > 1) {
        if (lb[0] == 0) mp2[idl[1]][2] = 1;
        if (rb[0] == 1) mp2[idr[1]][2] = 0;
    }
}
}  // namespace case2

namespace case3 {
void solve() {
    for (int i = lenl - 1; i >= 0; i--)
        if (lb[i] == 0) {
            cntb = i;
            break;
        }
    for (int i = lenr - 1; i >= 0; i--)
        if (rb[i] == 1) {
            cntb = max(cntb, i);
            break;
        }
    if (lenr - lenl > 1) cntb = max(cntb, lenr - 1);
    for (int i = 1; i <= cntb; ++i) idb[i] = ++tot;
    if (lenr - lenl > 1) {
        for (int i = lenr - 1; i > lenl; i--) {
            mp[1][idb[i]] = 1;
        }
    }
    for (int i = lenl - 1; i >= 1; i--)
        if (lb[i] == 0) {
            mp[idl[i + 1]][idb[i]] = 1;
        }
    for (int i = lenr - 1; i >= 1; i--)
        if (rb[i] == 1) {
            mp[idr[i + 1]][idb[i]] = 0;
        }
    if (R - L > 1) {
        if (lb[0] == 0) mp2[idl[1]][2] = 1;
        if (rb[0] == 1) mp2[idr[1]][2] = 0;
    }
}
}  // namespace case3
signed main() {
    cin >> L >> R;
    for (int i = 0; i <= 100; ++i)
        for (int j = 0; j <= 100; ++j) mp2[i][j] = mp[i][j] = -1;
    for (int i = 0; i <= 20; ++i) {
        if (L & (1 << i)) lenl = i, lb[i] = 1;
        if (R & (1 << i)) lenr = i, rb[i] = 1;
    }

    if (L == R) {
        case1::solve();
        return 0;
    }
    // L chain
    mp[1][lenl + tot] = 1;
    mp[tot + 1][2] = lb[0];
    for (int i = lenl; i > 1; i--)
        mp[i + tot][i - 1 + tot] = lb[i - 1], idl[i] = i + tot;
    idl[1] = tot + 1;
    tot += lenl;

    // R chain
    mp[1][lenr + tot] = 1;
    mp[tot + 1][2] = rb[0];
    for (int i = lenr; i > 1; i--)
        mp[i + tot][i - 1 + tot] = rb[i - 1], idr[i] = i + tot;
    idr[1] = tot + 1;
    tot += lenr;

    if (lenl == lenr) {
        case2::solve();
    } else {
        case3::solve();
    }

    if (cntb) {
        mp[idb[1]][2] = 1;
        mp2[idb[1]][2] = 0;
        for (int i = cntb; i > 1; i--) mp[idb[i]][idb[i - 1]] = 1, mp2[idb[i]][idb[i - 1]] = 0;
    }
    cout << tot << endl;
    // return 0;
    for (int i = 1; i <= tot; ++i) {
        int k = 0;
        for (int j = 1; j <= tot; ++j)
            if (mp[i][j] >= 0) k++;
        for (int j = 1; j <= tot; ++j)
            if (mp2[i][j] >= 0) k++;
        cout << k << ' ';
        for (int j = 1; j <= tot; ++j)
            if (mp[i][j] >= 0) cout << j << ' ' << mp[i][j] << ' ';
        for (int j = 1; j <= tot; ++j)
            if (mp2[i][j] >= 0) cout << j << ' ' << mp2[i][j] << ' ';
        cout << endl;
    }
    return 0;
}