#include <bits/stdc++.h>
using namespace std;

#define BIT(x) (1ull << (x))
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) do {sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end());} while (0)
#define PB push_back
#define MP make_pair
#define SIZE(v) ((int)(v).size())
#define DEBUG(x) cout << #x << " = " << x << endl


#define print(x) do {printf("%d\n", x); fflush(stdout);} while (false)


int n, k;
int cur = 0;


int main()
{
	scanf("%d %d", &n, &k);
	
	if (k >= n - 1) print(n - 1);
	else print(0);
	
	while (true){
		scanf("%d", &cur);
		if (cur >= n) break;
		
		if (cur + k >= n - 1) print(n - 1);
		else print(max(cur + 1, min({cur + k, cur - k - 1, n - 1})));
	}
}