#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};


int main(){
	int n,k;
	int mode = 0;					//先手
	int in = 0;
	int next;
	cin >> n >> k;
	
	next = (n - 1) % (k + 1);
	if(next == 0){
		next += k + 1;
		mode = 1;
		cout << 0 << endl;
	}
	
	while(true){
		if(mode == 0){	//自分のターン
			cout << next << endl;
			next += k + 1;
		}else{			//相手のターン
			cin >> in;
			if(in >= n){
				return 0;
			}
		}
		mode = 1 - mode;
	}
	
    
    return 0;
}