#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
bool b[22] = { false }, b1[22] = { false };
int vec[22], vec1[22];
int main() {
	long long n, s;
	cin >> n >> s;
	long long k = 1;
	for (int i = 1; i < s; i++) {
		k *= i;
	}
	for (int i = 0; i < s - 1; i++) {
		long long num = n / k;
		n %= k;
		long long co = -1;
		for (int j = 1; j <= s; j++) {
			if (!b[j]) {
				co++;
			}
			if (co == num) {
				vec[i] = j;
				b[j] = true;
				break;
			}
		}
		k /= (s - i - 1);
	}
	for (int i = 1; i <= s; i++) {
		if (!b[i]) {
			vec[s - 1] = i;
		}
	}
	for (int i = 0; i < s; i++) {
		vec1[vec[i] - 1] = i + 1;
	}
	for (int i = 1; i < s; i++) {
		k *= i;
	}
	long long ans = 0;
	for (int i = 0; i < s - 1; i++) {
		int co = -1;
		for (int j = 1; j <= s; j++) {
			if (!b1[j]) {
				co++;
			}
			if (j == vec1[i]) {
				ans += k * co;
				b1[j] = true;
				break;
			}
		}
		k /= (s - i - 1);
	}
	cout << ans << endl;
}