#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define LL long long
#define INF 1000000001
#define mod 1000000007
using namespace std;
int keta(int n,int k){return (n/int(pow(10,double(k-1)))) % 10;} //nの下からk桁目
ll gcd(ll n,ll m){
	if(n<m){ll a=m;m=n;n=a;}
	ll r=n%m;
	while(r!=0){
		n=m;
		m=r;
		r=n%m;
	}
	return m;
}
ll lcm(ll n,ll m){
	return n*m/gcd(n,m);
}

int main(){
	
	int n,k;
	cin>>n>>k;
	int a;
	if((n-1)%(k+1)==0){
		printf("0\n");
		cin>>a;
		int i=1;
		while(a<n){
			printf("%d\n",(k+1)*i);
			i++;
			cin>>a;
		}
		return 0;
	}
	printf("%d\n",(n-1)%(k+1));
	cin>>a;
	int i=1;
	while(a<n){
		printf("%d\n",(n-1)%(k+1)+(k+1)*i);
			i++;
			cin>>a;
	}
	return 0;

}