#include <bits/stdc++.h>
namespace FastIO {
bool IOerror = 0;
inline char nc() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOerror = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
template <class T>
inline bool read(T& x) {
  bool sign = 0;
  char ch = nc();
  x = 0;
  for (; blank(ch); ch = nc())
    ;
  if (IOerror) return false;
  if (ch == '-') sign = 1, ch = nc();
  for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
  if (sign) x = -x;
  return true;
}
template <class T, class... U>
bool read(T& h, U&... t) {
  return read(h) && read(t...);
}
};  // namespace FastIO
using namespace std;
using namespace FastIO;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int INF = 0x3f3f3f3f;
int vis[111111];
int n, m;
int main() {
  scanf("%d%d", &m, &n);
  for (int i = 0; i < n; i++) {
    printf("1\n");
    fflush(stdout);
    int x;
    scanf("%d", &x);
    if (x == 1)
      vis[i] = 1;
    else if (x == -1)
      vis[i] = 0;
    else
      exit(0);
  }
  int l = 1, r = m;
  int cnt = 0;
  while (r >= l) {
    int mid = (l + r) / 2;
    printf("%d\n", mid);
    fflush(stdout);
    int x;
    scanf("%d", &x);
    if (x == 0) exit(0);
    if (vis[cnt % n] == 1) {
      if (x == 1)
        l = mid + 1;
      else
        r = mid - 1;
    } else {
      if (x == 1)
        r = mid - 1;
      else
        l = mid + 1;
    }
    cnt++;
  }
  return 0;
}
