#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <math.h>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll n,k; cin >> n >> k;
	ll now=0;
	ll p=(n-1)%(k+1);
	if(p==0){
		cout << 0 << endl;
		cin >> now;
		if(now>=n){
			return 0;
		}
	}
	while(now<n){
		ll q=p-now%(k+1);
		if(q<0)q+=k+1;
		cout << now+q << endl;
		cin >> now;
	}
}