#line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>

using namespace std;

using lint = unsigned long long;

lint fact(lint n) {
    lint p = 1;
    for (lint x = 1; x <= n; ++x) p *= x;
    return p;
}

void solve() {
    lint p;
    int n;
    cin >> p >> n;

    vector<int> ps(n);
    {
        vector<int> rem(n);
        iota(rem.begin(), rem.end(), 0);

        for (int i = 0, j = n - 1; i < n; ++i, --j) {
            lint x = p / fact(j);
            p %= fact(j);

            ps[i] = rem[x];
            rem.erase(rem.begin() + x);
        }
    }

    vector<int> qs(n);
    for (int i = 0; i < n; ++i) qs[ps[i]] = i;

    lint ans = 0;
    {
        vector<int> app;

        for (int i = 0, j = n - 1; i < n; ++i, --j) {
            int x = qs[i];
            for (auto y : app) {
                if (y < qs[i]) --x;
            }
            ans += x * fact(j);

            app.push_back(qs[i]);
        }
    }
    cout << ans << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}