#include <bits/stdc++.h>

using i64 = long long;

const int N = 100;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int L, R;
  std::cin >> L >> R;

  int cur = 1, idx = 0;
  std::vector<std::vector<std::pair<int, int>>> adj(N);

  std::vector<int> id(20);

  auto work = [&](int x) {
    while (idx <= x) {
      if (idx > 0) {
        adj[cur].emplace_back(id[idx - 1], 0);
        adj[cur].emplace_back(id[idx - 1], 1);
      }
      id[idx] = cur;
      cur++;
      idx++;
    }
    return id[x];
  };

  auto dfs = [&](auto self, int d, int l, int r, int x, int y) -> int {
    if (l >= x && r <= y) {
      return work(d);
    }
    int m = (l + r) / 2;
    int p = cur++;
    if (x <= m) {
      adj[p].emplace_back(self(self, d - 1, l, m, x, y), 0);
    }
    if (y > m) {
      adj[p].emplace_back(self(self, d - 1, m + 1, r, x, y), 1);
    }
    return p;
  };

  for (int i = 0; i < 20; i++) {
    int l = (1 << i);
    int r = (1 << i + 1) - 1;
    l = std::max(l, L);
    r = std::min(r, R);
    if (l <= r) {
      adj[0].emplace_back(dfs(dfs, i, (1 << i), (1 << i + 1) - 1, l, r), 1);
    }
  }

  std::cout << cur << "\n";
  for (int i = 0; i < cur; i++) {
    std::cout << adj[i].size() << " ";
    for (auto [y, w] : adj[i]) {
      std::cout << y + 1 << " " << w << " ";
    }
    std::cout << "\n";
  }

  return 0;
}