#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  int n, k;
  cin >> n >> k;
  int cur = 0;
  while (cur < n) {
    cout << (n - 1 - cur) % (k + 1) + cur << endl;
    cin >> cur;
    assert((n - 1 - cur) % (k + 1) != 0);
  }
  return 0;
}