#include <map>
#include <set>
#include <list>
#include <array>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <tuple>
#include <bitset>
#include <cfloat>
#include <memory>
#include <vector>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <iostream>
#include <algorithm>
#include <functional>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define per(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << " \n"[_ == r]

const int K = 20;
const int N = 1e2 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + (c - 48);
  return x * f;
}

int L, R, n, rt, in[N], out[N];
bool tag[N];
vector <int> id;
vector <pair <int, int>> e[N];

void add(int u, int v, int o) {
  e[u].emplace_back(make_pair(v, o));
}

void work() {
  for (int i = 0; i < n; ++i) {
    for (auto [j, o] : e[i]) ++in[j], ++out[i];
  }
  int k = 0;
  rep(i, 0, K) if (in[i] > 2 * (i < K)) k = i;
  rep(i, 0, k) id.emplace_back(i); 
  for (int i = K + 1; i < n; ++i) {
    if (i == rt || (in[i] && out[i])) {
      id.emplace_back(i);
    }
  }
  for (int i : id) tag[i] = true;
}

int rk(int i) {
  return lower_bound(id.begin(), id.end(), i) - id.begin() + 1;
}

void print() {
  int m = id.size();
  // pa(id, 0, m - 1);
  printf("%d\n", m);
  for (int i = 0; i < n; ++i) if (tag[i]) {
    printf("%d ", (int) e[i].size());
    for (auto [j, o] : e[i]) {
      printf("%d %d ", rk(j), o);
    }
    printf("\n");
  }
}

int dfs(int d, int l, int r) {
  if (R < l || r < L) return 0;
  int u = n++;
  if (l == 0 && r == (1 << K) - 1) rt = u;
  // cout << "u, d, l, r = " << u << ' ' << d << ' ' << l << ' ' << r << endl;
  int mid = (l + r) >> 1;
  if (L <= l && mid <= R) {
    add(u, d, 0);
  } else {
    int v = dfs(d - 1, l, mid);
    if (l && v && e[v].size()) add(u, v, 0);
  }
  if (L <= mid + 1 && r <= R) {
    add(l == 0 ? rt : u, d, 1);
  } else {
    int v = dfs(d - 1, mid + 1, r);
    // cout << "u, v = " << u << ' ' << v << endl;
    if (v && e[v].size()) add(l == 0 ? rt : u, v, 1);
  }
  return u;
}

int main() {
  L = read(), R = read();
  n = K + 1;
  for (int i = K; i; --i) {
    add(i, i - 1, 0);
    add(i, i - 1, 1);
  }
  dfs(K - 1, 0, (1 << K) - 1);
  // pv(rt);
  work();
  // pv(rk(rt));
  print();
  return 0;
}