#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int U;
vector<vector<pair<int, int>>> graph;
void init() {
  U = 0;
  graph.clear();
}
int newNode() {
  const int u = U++;
  graph.emplace_back();
  return u;
}
void ae(int u, int v, int a) {
  graph[u].emplace_back(v, a);
}

constexpr int E = 20;
int ts[E + 1];
int two(int e) {
  int &u = ts[e];
  if (!~u) {
    u = newNode();
    if (e) {
      const int v = two(e - 1);
      ae(u, v, 0);
      ae(u, v, 1);
    }
  }
  return u;
}

int dfs(int e, int a, int b) {
  chmax(a, 0);
  chmin(b, 1<<e);
  if (a >= b) return -1;
  if (a == 0 && b == 1<<e) return two(e);
  --e;
  int u = newNode();
  const int vL = dfs(e, a, b);
  const int vR = dfs(e, a - (1<<e), b - (1<<e));
  if (~vL) ae(u, vL, 0);
  if (~vR) ae(u, vR, 1);
  return u;
}

int main() {
  int L, R;
  for (; ~scanf("%d%d", &L, &R); ) {
    init();
    memset(ts, ~0, sizeof(ts));
    const int src = newNode();
    ts[0] = newNode();
    for (int e = 0; e < E; ++e) {
      // [2^e, 2^(e+1))
      const int v = dfs(e, L - (1<<e), R + 1 - (1<<e));
      if (~v) ae(src, v, 1);
    }
    
    printf("%d\n", U);
    for (int u = 0; u < U; ++u) {
      printf("%d", (int)graph[u].size());
      for (const auto &edge : graph[u]) {
        printf(" %d %d", edge.first + 1, edge.second);
      }
      puts("");
    }
  }
  return 0;
}