#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

// grundy abs(i-N)%(K+1)
// 先手 0以外
// 後手 0

// 0 1 2 3 4 5 6 7 8 9
// 0 3 2 1 0 3 2 1 0

// 0 1 2 3 4 5 6 7 8 9 10
// 1 0 3 2 1 0 3 2 1 0

// 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
// 0 3 2 1 0 3 2 1 0 3  2  1  0  3  2  1  0  3  2  1  0


int main(void){
	int N,K;
	cin >> N >> K;

	cout << (N-1)%(K+1) << endl;
	cout.flush();

	while(1){
		int in;
		cin >> in;
		if(in>=N) break;
		int out=(N-1-in)%(K+1);
		out+=in;
		cout << out << endl ;
		cout.flush();
	}
	return 0;
}