#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int n, k, s;
    cin >> n >> k;
    if (n >= 3) {
        s = (n-2)%k;
        if (s == 1) cout << 0 << endl;
        else cout << s << endl;
    } else if (n == 2) {
        cout << 1 << endl;
        s = 0;
        return 0;
    } else if (n == 1) {
        cout << 0 << endl;
        s = 0;
        return 0;
    }
    
    while (s < n){
        s += k;
        int opp;
        cin >> opp;
        if (opp >= n) return 0;
        cout << s << endl;
    }
}