#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
int const inf = 1<<29;

int main() {

  ll n, k; cin >> n >> k;

  if(n == 1) {
    cout << 0 << endl;
    int x; cin >> x;
    exit(0);
  }
  if(n == 2) {
    cout << 1 << endl;
    int x; cin >> x;
    exit(0);
  }

  int curr = 2; cout << curr << endl;
  while(1) {
    if(curr >= n) { exit(0); }
    if(curr + 1 == n) {
      assert(0&&"これもうわかんねぇな？お前どう？");
    }
    else if(curr + k >= n && curr + 1 < n) {
      cout << n-1 << endl;
    }
    else if(curr < n - k - 2 && curr + 2 * k >= n) {
      cout << n - k - 2 << endl;
    }
    else if(curr < curr + k - 1 && curr + 2 * k + 1 == n) {
      cout << curr + k - 1 << endl;
    }
    else {
      curr += k;
      cout << curr << endl;
    }
    cin >> curr;
  }

  return 0;
}