#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int main(){
	int n,k;
	int in=-1,val=0;
	cin>>n>>k;
	

	if(n%(k+1)==1){
		cout<<0<<endl;
		cin>>in;
		val=in;
	}
	if(in==n)return 0;
	while(1){
		int add;
		val=n-val;
		if(val%(k+1)==0)add=k;
		else add=val%(k+1)-1;
		val-=add;
		val=n-val;
		cout<<val<<endl;
		if(!(cin>>in)||in==n)break;
		val=in;
	}

	return 0;
}