#include <bits/stdc++.h>
#define con const
using namespace std;

using i32 = int32_t;
using i64 = int64_t;
#define i128 __int128_t
using u32 = uint32_t;
using u64 = uint64_t;
using f64 = long double;

template<class T>
using lque = priority_queue<T, vector<T>, greater<T>>;
template<class T>
using gque = priority_queue<T>;

template<class T>
void mes(T * arr, u32 n, int val) {
    memset(arr, val, n*sizeof(T));
}

template<u32 M, class N=u32>
u64 mpow(u64 x, N nth=M-2) {
    u64 res(x!=0||nth==0);
    for(; nth; x=(x*x)%M, nth>>=1)
        if(nth&1) res = (res*x)%M;
    return res;
}
// -------------------
con i32 MX = 100 + 7;
con i32 MOD = 998244353;

u32 l, r, lgl;
u32 ln[MX], rn[MX], ite=2;

// s = 1, t = 2;
u32 cu=2, ch=0;

vector<u32> vec;

void solve() {
    cout << ite << '\n';
    cout << vec.size();
    for(u32 v:vec) {
        cout << ' ' << v << " 1";
    }
    for(u32 u=2; u<=ite; ++u) {
        if(ln[u]&&rn[u]) {
            cout << "\n2 " << ln[u] << " 0 " << rn[u] << " 1";
        } else if(ln[u]) {
            cout << "\n1 " << ln[u] << " 0";
        } else if(rn[u]) {
            cout << "\n1 " << rn[u] << " 1";
        } else cout << "\n0";
    }
}

// 获取高度为h的满构造tree
u32 get_tree(u32 h) {
    if(h>ch) {
        u32 u = ++ite;
        if(h==1) {
            ln[u] = rn[u] = 2;
        } else {
            ln[u] = get_tree(h-1);
            rn[u] = ++ite;
            ln[rn[u]] = ln[ln[u]];
            rn[rn[u]] = rn[ln[u]];
        }
        ++ch;
        cu = u;
        return u;
    } else {
        u32 u = cu;
        for(u32 i=ch; i>h; --i)
            u = ln[u];
        return u;
    }
}

u32 build_tree(u32 l, u32 r, u32 lb, u32 rb) {
    if(l==lb&&rb==r) {
        u32 h = 0;
        while((1<<h)<(rb-lb)) ++h;
        return get_tree(h);
    } else {
        u32 u = lb?++ite:1, nl=0, nr=0;
        con u32 mid = (lb + rb) / 2;
        if(l<mid) nl = build_tree(l, min(mid, r), lb, mid);
        if(r>mid) nr = build_tree(max(l, mid), r, mid, rb);
        if(u!=1) {
            ln[u] = nl; rn[u] = nr;
        } else if(nr) {
            vec.push_back(nr);
        }
        return u;
    }
}

void pre() {
    cin >> l >> r;
    while((1<<lgl)<=r) ++lgl;
    build_tree(l, r+1, 0, 1<<lgl);
}

u32 _t = 1;
void init() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // cin >> _t;
}

int main() {
    init();
    for(;_t--;) {
        pre();
        solve();
    }
}