#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

const int N = 105;

std::vector<std::pair<int, int>> g[N];
int tot;
int p[N];

inline void print(){
    std::cout << tot << endl;
    fore(i, 1, tot + 1){
        std::cout << g[i].size() << ' ';
        for(auto [v, w] : g[i]) std::cout << v << ' ' << w << ' ';
        std::cout << endl;
    }
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int l, r;
    std::cin >> l >> r;
    int s = 1, e = 0;
    int h = 19;
    while(!(r >> h & 1)) --h;
    int hl = 19;
    while(!(l >> hl & 1)) --hl;
    while(h >= 0){
        int x = (l >> h & 1), y = (r >> h & 1);
        if(x != y) break;
        g[s].push_back({s + 1, x});
        ++s;
        --h;
    }
    tot = s;
    if(h < 0){
        print();
        return 0;
    }

    e = ++tot;
    int b1 = 0, b2 = 0;
    for(int i = h - 1; i >= 0; --i)
        if(!(l >> i & 1)){
            b1 = i;
            break;
        }
    for(int i = h - 1; i >= 0; --i)
        if(r >> i & 1){
            b2 = i;
            break;
        }
    int bit = std::max(b1, b2);
    p[0] = e;
    fore(i, 1, bit + 1){
        p[i] = ++tot;
        g[p[i]].push_back({p[i - 1], 0});
        g[p[i]].push_back({p[i - 1], 1});
    }

    if(!h){
        g[s].push_back({e, 0});
        g[s].push_back({e, 1});
        print();
        return 0;
    }

    /* L */
    int now = s;
    if(h <= hl){
        g[s].push_back({++tot, 0});
        now = tot;
    }
    for(int i = h - 1; i >= 0; --i){
        int c = l >> i & 1;
        if(!i) g[now].push_back({e, c});
        else if(i <= hl) g[now].push_back({++tot, c});
        if(!c) g[now].push_back({p[i], 1});
        if(i <= hl) now = tot;
    }

    /* R */
    g[s].push_back({++tot, 1});
    now = tot;
    for(int i = h - 1; i >= 0; --i){
        int c = r >> i & 1;
        if(!i) g[now].push_back({e, c});
        else g[now].push_back({++tot, c});
        if(c) g[now].push_back({p[i], 0});
        now = tot;
    }

    print();

    
    return 0;
}