#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template<typename T>
static ostream& operator<<(ostream& o, const std::vector<T>& v) {
  o << "[ "; for(const auto& e : v) o<<e<<' ';
  return o << ']';
}

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);

//

constexpr int T = 3600;
constexpr int R = 4;

//

struct Player {
  int level;
  int id;
  int tick; // TODO:
  inline bool operator<(const Player &p) const { return level < p.level; }
};

struct Room {
  vector<Player> players;
  int penalty;

  Room() : players(), penalty(0) {}
  Room(Player &&player) : players({player}), penalty(0) {}
  Room(int tick, initializer_list<Player> li) : players(), penalty(0) {
    auto it = li.begin();
    if (it == li.end())
      return;
    players.push_back(*it);
    ++it;
    for (; it != li.end(); ++it) {
      Room r(move(Player(*it)));
      merge(tick, move(r));
    }
  }

  int id() const { return players.empty() ? 0 : players.front().id; }
  int score() const {
    int ma = 0;
    int mi = 100;
    for (auto &p : players) {
      chmax(ma, p.level);
      chmin(mi, p.level);
    }
    int v = 200 - (ma - mi) * (ma - mi);
    v *= players.size() == 2
             ? 1
             : players.size() == 3 ? 3 : players.size() == 4 ? 6 : 0;
    return max(0, v - penalty);
  }

  void merge(int tick, Player &&player) { merge(tick, Room(move(player))); }
  void merge(int tick, Room &&room) {
    penalty += room.penalty;
    penalty += 2 * tick * players.size() * room.players.size();
    for (auto &p : players)
      penalty -= p.tick * room.players.size();
    for (auto &p : room.players)
      penalty -= p.tick * players.size();
    players.insert(players.end(), room.players.begin(), room.players.end());
  }
};

class Game {
  int tick_;
  int player_id_;

public:
  inline int tick() const { return tick_; }
  void initialize() {
    int t, r;
    scanner >> t >> r;
    assert(T == t);
    assert(R == r);
    tick_ = 0;
  }
  vector<Player> proceedTick() {
    assert(++tick_ <= T);
    int n;
    scanner >> n;
    vector<Player> v(n);
    repeat(i, n) {
      int l;
      scanner >> l;
      v[i].level = l;
      v[i].id = ++player_id_;
      v[i].tick = tick_;
    }
    return v;
  }

  bool uniteTeam(const vector<pair<int, int>> &uni) {
    printer << int(uni.size()) << '\n';
    for (auto &p : uni) {
      printer << p.first << ' ' << p.second << '\n';
    }
    cout.flush();
    return tick_ < T;
  }
};

//

class Solver : Game {
  vector<Player> stock_;
  vector<Room> room_;
  vector<Room> room4_;

  vector<pair<int, int>> gameloop() {
    constexpr int kThreshold = 3;
    constexpr int kThresholdT = 400;

    vector<pair<int, int>> unions;

    auto newcomer = proceedTick();
    stock_.insert(stock_.end(), all(newcomer));

    // よみにくい
    bool pair_mode = false;
    repeat(_, 99) {
      if (room_.empty() || pair_mode) {
        int ok = -1;
        sort(all(stock_));
        repeat(i, int(stock_.size() - 1)) {
          if (stock_[i + 1].level - stock_[i].level <= kThreshold) {
            ok = i;
            break;
          }
        }
        if (ok == -1)
          break;
        room_.push_back(Room(tick(), {stock_[ok], stock_[ok + 1]}));
        unions.push_back({stock_[ok].id, stock_[ok + 1].id});
        stock_.erase(stock_.begin() + ok, stock_.begin() + ok + 2);
        pair_mode = false;
        continue;
      } else {
        bool ok = false;
        repeat(i, int(stock_.size())) {
          repeat(j, int(room_.size())) {
            auto mima = minmax_element(all(room_[j].players));
            int s = stock_[i].level;
            int mi = min(mima.first->level, s);
            int ma = max(mima.second->level, s);
            int mitick = T;
            for (auto p : room_[j].players)
              chmin(mitick, p.tick);
            if (ma - mi <= kThreshold || (tick() - mitick) > kThresholdT) {
              ok = true;
              unions.push_back({stock_[i].id, room_[j].players[0].id});
              room_[j].merge(tick(), move(stock_[i]));
              // { clog << room_[j].penalty << " " << (tick() - mitick) << endl;
              // }
              if (room_[j].players.size() >= 4) {
                room4_.push_back(move(room_[j]));
                room_.erase(room_.begin() + j);
              }
              stock_.erase(stock_.begin() + i);
              break;
            }
          }
          if (ok)
            break;
        }
        pair_mode = !ok;
      }
    }

    // validate score
    if (tick() == T) {
      int total = 0;
      for (auto &r : room_) {
        total += r.score();
      }
      for (auto &r : room4_) {
        total += r.score();
      }
      clog << total << endl;
    }

    if (tick() == T) {
      vector<Room> room2;
      for (auto &r : room_) {
        if (r.players.size() == 2) {
          room2.push_back(r);
          r.players.clear();
        }
      }
      repeat(i, room2.size() / 2) {
        auto &rooma = room2[i * 2];
        auto &roomb = room2[i * 2 + 1];
        int s1 = rooma.score() + roomb.score();
        rooma.merge(T, Room(roomb));
        int s2 = rooma.score();
        if (s1 < s2) {
          unions.emplace_back(rooma.id(), roomb.id());
        }
      }
      if (room2.size() % 2 == 1)
        room_.push_back(room2.back());

      sort(all(room_), [](const Room &r1, const Room &r2) {
        return r1.players.size() > r2.players.size();
      });

      for (auto r : room_) {
        if (r.players.size() <= 1 || r.players.size() >= 4)
          continue;
        while (!stock_.empty()) {
          auto p = stock_.back();
          stock_.pop_back();

          auto tr = r;
          int s1 = r.score();
          tr.merge(tick(), move(p));
          int s2 = tr.score();
          if (s1 < s2) {
            r = move(tr);
            unions.emplace_back(p.id, r.id());
          }

          if (r.players.size() >= 4)
            break;
        }
      }
    }

    return unions;
  }

public:
  void solve() {
    Game::initialize();

    while (true) {
      auto uu = gameloop();
      if (!uniteTeam(uu))
        break;
    }

    cerr << 0 << endl; // TODO: print score
  }
};

//

int main() {
  Solver().solve();
  return 0;
}