#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main()
{
    ll n, k;
    cin >> n >> k;
    ll ans = 1;
    set<ll> a;
    rep(s, 0, 1<<k){
        ans = 1;
        rep(i, 0, k){
            if(s>>i&1){
                if(ans == n) ans = 1;
                else ans++;
            }
            else{
                if(ans == 1) ans = n;
                else ans--;
            }
        }
        //cout << ans << endl;
        a.insert(ans);
    }
    cout << a.size() << endl;
    return 0;
}