#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= 0, t;
    cin >> n >> k;
    if (n == 1){
        cout << 0 << endl;
        return 0;
    }
    t = (n-1)%(k+1);
    if (!t) {
        cout << 0 << endl;
        cin >> s;
    } else s = 0;
    while (s < n){
        for (int i = s + 1; i <= s + k; i++){
            if (i%(k+1) == t) {
                cout << i << endl;
                break;
            }
        }
        cin >> s;
    }
}