#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}



void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int L, R;
    cin >> L >> R;
    map<pair<int, int>, int> m;
    vector<pair<int, int>> p;
    R++;
    m[{L, R}] = 1;
    m[{-1, -1}] = 0;
    vector<vector<pair<int, int>>> G(2);
    p.push_back({-1, -1});
    p.push_back({L, R});
    auto add = [&](int l, int r) -> int {
        auto tmp = make_pair(l, r);
        if (m.count(tmp)) return m[tmp];
        G.push_back({});
        m[tmp] = m.size();
        p.push_back(tmp);
        return m[tmp];
    };
    rep(rp, 1, p.size()){
        int X, Y;
        tie(X, Y) = p[rp];
        if (X == 1){
            int ind = add(-1, -1);
            G[ind].push_back({rp, 1});
            X++;
        }
        rep(d, 0, 2){
            int a = (X + 1 - d) / 2;
            int b = (Y + 1 - d) / 2;
            if (a == b) continue;
            int ind = add(a, b);
            G[ind].push_back({rp, d});
        }
    }
    cout << G.size() << "\n";
    for (auto x : G){
        cout << x.size();
        for (auto y : x){
            cout << " " << y.first + 1 << " " << y.second;
        }
        cout << "\n";
    }
}