#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

int N,K;
int ans,now;
vector<int> vt;
int main() {
    cin>>N>>K;
    for(int i=0;N-1-(K+1)*i>=0;i++){
        vt.push_back(N-1-(K+1)*i);
    }
    reverse(vt.begin(),vt.end());
    p(vt[0]);
    while(1){
        cin>>now;
        if(now>=N) break;
        p(*upper_bound(vt.begin(), vt.end(), now));
    }
    return 0;
}