#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int L, R;
  IN(L, R);
  vector<tuple<int, int, int>> edges;
  for (int i : Rep(80, 100)) {
    edges.emplace_back(i, i + 1, 0);
    edges.emplace_back(i, i + 1, 1);
  }
  int nxt = 1;
  for (int k : Rep1(1, 20)) {
    int l = max(L, 1 << (k - 1));
    int r = min(R, (1 << k) - 1);
    if (r < l) {
      continue;
    }
    if (r - l + 1 == 1 << (k - 1)) {
      edges.emplace_back(0, 100 - k + 1, 1);
      continue;
    }

    string s(k, '0');
    string t(k, '0');
    for (int i : Rep(0, k)) {
      if (l >> (k - i - 1) & 1) {
        s[i] = '1';
      }
      if (r >> (k - i - 1) & 1) {
        t[i] = '1';
      }
    }

    int pl = 0, pr = 0;
    bool same = true;
    for (int i : Rep(0, k)) {
      if (s[i] < t[i]) {
        same = false;
      }
      int nl, nr;
      if (i + 1 == k) {
        nl = nr = 100;
      } else if (same) {
        nl = nr = nxt++;
      } else {
        nl = nxt++;
        nr = nxt++;
      }

      if (same) {
        edges.emplace_back(pl, nl, s[i] - '0');
      } else {
        edges.emplace_back(pl, nl, s[i] - '0');
        edges.emplace_back(pr, nr, t[i] - '0');
        if (pl != pr && s[i] == '0') {
          edges.emplace_back(pl, 100 - (k - i - 1), 1);
        }
        if (pl != pr && t[i] == '1') {
          edges.emplace_back(pr, 100 - (k - i - 1), 0);
        }
      }

      pl = nl;
      pr = nr;
    }
  }

  vector<bool> need(101, true);
  {
    vector<vector<int>> g(101);
    for (auto [i, j, x] : edges) {
      g[i].push_back(j);
    }
    vector<bool> f(101);
    f[0] = 1;
    for (int i : Rep(0, 100)) {
      if (f[i]) {
        for (int j : g[i]) {
          f[j] = true;
        }
      }
    }
    for (int i : Rep1(0, 100)) {
      if (!f[i]) {
        need[i] = false;
      }
    }
  }
  {
    vector<vector<int>> g(101);
    for (auto [i, j, x] : edges) {
      g[j].push_back(i);
    }
    vector<bool> f(101);
    f[100] = 1;
    for (int i : Rev(Rep1(1, 100))) {
      if (f[i]) {
        for (int j : g[i]) {
          f[j] = true;
        }
      }
    }
    for (int i : Rep1(0, 100)) {
      if (!f[i]) {
        need[i] = false;
      }
    }
  }
  vector<int> U;
  for (int i : Rep1(0, 100)) {
    if (need[i]) {
      U.push_back(i);
    }
  }
  OUT(Sz(U));
  vector<vector<pair<int, int>>> g(Sz(U));
  for (auto [i, j, x] : edges) {
    if (!need[i] || !need[j]) {
      continue;
    }
    i = int(ranges::lower_bound(U, i) - U.begin());
    j = int(ranges::lower_bound(U, j) - U.begin());
    g[i].emplace_back(j + 1, x);
  }
  for (int i : Rep(0, Sz(g))) {
    OUT(Sz(g[i]), g[i]);
  }
}

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

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define Rev views::reverse
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Rep1(...) [](int l, int r) { return Rep(l, r + 1); }(__VA_ARGS__)
#define Sz(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1