#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;
using ull = unsigned long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); }return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
constexpr long long  mod = 998244353;

int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n, S; cin >> S >> n;
	vector<int> v(n);
	vector<bool> used(n);
	vector<ll> fac(n + 1); fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i;
	S += 1;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (used[j]) continue;
			if (fac[n - 1 - i] < S) {
				S -= fac[n - 1 - i];
			}
			else {
				used[j] = true;
				v[i] = j;
				break;
			}
		}
	}
	vector<int> t(n); for (int i = 0; i < n; i++) t[v[i]] = i;
	ll cnt = 0;
	used.assign(n, false);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < t[i]; j++) {
			if (used[j]) continue;
			cnt += fac[n - 1 - i];
		}
		used[t[i]] = true;
	}
	cout << cnt << endl;
}