#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main() {
    int n,k;cin>>n>>k;
    int d = (n-1)%(k+1);
    cout<<min(d,n-1)<<endl;
    int e;
    while(cin>>e){
        if(e>=n)break;
        cout<<min(d + ((e-d)/(k+1)+1)*(k+1),n-1)<<endl;
    }
    
    return 0;
}