#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

void put(int x) {
	printf("%d\n", x);
	fflush(stdout);
}

int get() {
	int x;
	scanf("%d", &x);
	return x;
}

int nextlosenum(int x, int K) {
	//(y-1) % (K+1) == 0
	return ((x - 1) / (K+1)) * (K+1) + 1;
}

int main() {
	int N, K;
	while(~scanf("%d%d", &N, &K)) {
		int n = 0;
		if((N-1) % (K+1) == 0) {
			put(0);
			while((n = get()) < N) {
				put(N - nextlosenum(N - n, K));
			}
		}else {
			n = 0;
			while(n < N) {
				put(N - nextlosenum(N - n, K));
				n = get();
			}
		}
	}
	return 0;
}