#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

int main() {
    int N, K;
    cin >> N >> K;
    if (N%(K+1) == 1) {
        cout << 0 << endl;
        cout.flush();
        int old = 0;
        while (1) {
            int x;
            cin >> x;
            if (x >= N) break;
            if (N-1-x <= K) {
                cout << N-1 << endl;
            } else {
                cout << old+K+1 << endl;
                old += K+1;
            }
            cout.flush();
        }
    } else {
        int old = (N%(K+1));
        if (old == 0) old += (K+1);
        old -= 1;
        cout << old << endl;
        cout.flush();
        while (1) {
            int x;
            cin >> x;
            if (x >= N) break;
            if (N-1-x <= K) {
                cout << N-1 << endl;
            } else {
                cout << old+K+1 << endl;
                old += K+1;
            }
            cout.flush();
        }
    }
    return 0;
}