#include <bits/stdc++.h>
using namespace std;
int main() {
  long long m, n, p[30], ans;
  cin >> m >> n;
  for (__typeof(0) i = 0; i <= n - 1; i++) {
    cout << "1\n";
    fflush(stdout);
    cin >> ans;
    if (ans == 0) return 0;
    if (ans == -1)
      p[i] = 0;
    else
      p[i] = 1;
  }
  long long low = 1, high = m, mid, i = 0;
  while (low <= high) {
    mid = (low + high) / 2;
    cout << mid << "\n";
    fflush(stdout);
    cin >> ans;
    if (p[i] == 0) ans *= -1;
    i = (i + 1) % n;
    if (ans == 0 || ans == -2 || ans == 2) return 0;
    if (ans == -1)
      high = mid - 1;
    else if (ans == 1)
      low = mid + 1;
    else
      return 0;
  }
  return 0;
}
