#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 clamp(int x, int mn, int mx)
{
	return max(mn, min(mx, x));
}

int n, k;
int cur = 0;


int memo[100000000 + 1];
int search(int x)
{
	if (~memo[x]) return memo[x];
	if (x == n - 1){
		return memo[x] = n;
	}
	if (x >= n - 1 - k){
		return memo[x] = n - 1;
	}
	REP(i, k){
		if (search(x + i + 1) >= n){
			return memo[x] = x + i + 1;
		}
	}
	return memo[x] = x + 1;
}


int main()
{
	memset(memo, -1, sizeof(memo));
	REP(i, k + 1){
		if (search(i) < n){
			print(i);
			break;
		}
	}
	
	scanf("%d %d", &n, &k);
	while (true){
		scanf("%d", &cur);
		if (cur >= n) break;
		
		print(search(cur));
	}
}