#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;



int main(){
	int n,k;
	cin >> n >> k;

	bool first = ((n-1) % (k+1) != 0);
	int val = 0;
	int b;
	if(first == false){
		cout << 0 << endl;
		cin >> b;
		val += b;
	}

	while(val < n){
		int r = (n-1-val)%(k+1);
		if(r == 0) r += k;
		val += r;

		cout << r << endl;
		cin >> b;
		val += b;
	}

	return 0;
}