#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
// #define max(a, b) ((a) > (b) ? (a) : (b))
// #define min(a, b) ((a) < (b) ? (a) : (b))
#define pb push_back
#define LNF 1e18
#define INF 0x7fffffff
#define int long long
#define lowbit(x) ((x) & (-x))
#define abs(x) llabs(x)
#define endl '\n'
#define Y() cout << "Yes" << endl
#define N() cout << "No" << endl
const db eps = 1e-9;
const int mod = 998244353;
const int MAXN = 2e5 + 5;
int l, r, cnt = 0, dp[1005][2][2];

vector<pair<int, int>> pth[1005], pt[1005];
int sol(int ws, int isl, int isr)
{
    if (ws == -1)
        return 1000;
    if (dp[ws][isl][isr])
        return dp[ws][isl][isr];
    dp[ws][isl][isr] = ++cnt;

    if (isl && isr)
    {
        if (l & (1 << ws))
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 1, 1), 1});
        }
        else if (r & (1 << ws))
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 1), 1});
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 1, 0), 0});
        }
        else
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 1, 1), 0});
        }
    }
    else if (isl)
    {
        if (l & (1 << ws))
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 1, 0), 1});
        }
        else
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 0), 1});
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 1, 0), 0});
        }
    }
    else if (isr)
    {
        if (r & (1 << ws))
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 1), 1});
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 0), 0});
        }
        else
        {
            pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 1), 0});
        }
    }
    else
    {
        pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 0), 1});
        pth[dp[ws][isl][isr]].push_back({sol(ws - 1, 0, 0), 0});
    }
    return dp[ws][isl][isr];
}
int is[1005];
map<int, int> mp;
void solve()
{

    cin >> l >> r;
    sol(21, 1, 1);
    // cout << -1 << endl;
    // cout << cnt << endl;
    int now = 1;
    for (int i = 1; i <= cnt; i++)
    {
        if (!is[i])
        {
            mp[i] = 1;
            // cout << i << endl;
        }
        else
            mp[i] = ++now;
        // cout << i << endl;
        for (auto [to, w] : pth[i])
        {
            is[to] |= w;
            is[to] |= is[i];
            // cout << to << " " << w << endl;
        }
    }

    mp[1000] = ++now;
    for (int i = 1; i <= cnt; i++)
    {
        for (auto [to, w] : pth[i])
        {
            if (mp[i] != mp[to])
                pt[mp[i]].push_back({mp[to], w});
        }
    }
    cout << now << endl;
    for (int i = 1; i <= now; i++)
    {
        cout << pt[i].size() << " ";
        for (auto [u, v] : pt[i])
            cout << u << " " << v << " ";
        cout << endl;
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}