#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C &a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C &a4, C b4) {
  a4 = max(a4, b4);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << "=" << h << "\n";
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
const long long INF = 10004205361450474LL;
long long f(long long x, long long y) {
  if (y == 1) {
    return min(2 * x, x + 10000LL);
  }
  long long cur = f(x, y - 1);
  if (x >= 1e4) {
    long long add = f(x, y - 1) - x;
    cur += (1 + add) * 10000;
    return cur;
  }
  for (long long i = (0); i <= ((long long)(min(10000LL, x)) - 1); i++) {
    cur = f(cur + 1, y - 1);
    if (cur >= INF + 1) {
      cur = INF + 1;
      break;
    }
  }
  return cur;
}
long long query(vector<long long> x) {
  cout << ((long long)(x).size()) << endl;
  for (long long a : x) {
    assert(a <= INF);
    cout << a << " ";
  }
  cout << endl;
  long long res;
  cin >> res;
  if (res == -2) {
    assert(false);
  }
  if (res == -1) {
    exit(0);
  }
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  if (0) cout << fixed << setprecision(6);
  long long cur = 1;
  long long q = 5;
  vector<long long> dupsko = {10000LL};
  for (long long i = (0); i <= ((long long)(3) - 1); i++) {
    long long lst = dupsko.back();
    lst *= 1e4;
    dupsko.push_back(lst);
  }
  (dupsko);
  while (q) {
    (q);
    vector<long long> todo;
    if (q == 1) {
      for (long long i = (0); i <= ((long long)(min(10000LL, cur)) - 1); i++) {
        if (cur + i > INF) {
          break;
        }
        todo.push_back(cur + i);
      }
    } else {
      long long tcur = cur;
      while (((long long)(todo).size()) < cur && todo.size() < 1e4) {
        long long res = f(tcur, q - 1);
        if (res == INF + 1) {
          break;
        }
        todo.push_back(res);
        tcur = res + 1;
      }
    }
    q--;
    long long x = query(todo);
    if (x == 0) {
      continue;
    }
    cur = todo[x - 1] + 1;
  }
}
