/* -*- coding: utf-8 -*-
 *
 * 1311.cc:  No.1311 Reverse Permutation Index - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_S = 20;

/* typedef */

typedef unsigned long long ull;

/* global variables */

ull fs[MAX_S + 1];
int ds[MAX_S], ps[MAX_S];
bool used[MAX_S];

/* subroutines */

int getunused(int s, int k) {
  for (int i = 0; i < s; i++)
    if (! used[i]) {
      if (k == 0) return i;
      k--;
    }
  return -1;
}

int countunused(int d) {
  int c = 0;
  for (int i = 0; i < d; i++)
    if (! used[i]) c++;
  return c;
}

/* main */

int main() {
  ull n;
  int s;
  scanf("%llu%d", &n, &s);

  fs[0] = 1;
  for (int i = 1; i <= s; i++) fs[i] = fs[i - 1] * i;
  //for (int i = 0; i <= s; i++) printf("fs(%d)=%llu\n", i, fs[i]);

  memset(used, false, sizeof(used));

  for (int i = 0; i < s; i++) {
    int k = n / fs[s - 1 - i];
    ds[i] = getunused(s, k);
    used[ds[i]] = true;
    n -= k * fs[s - 1 - i];
  }
  //for (int i = 0; i < s; i++) printf("%d ", ds[i]); putchar('\n');

  for (int i = 0; i < s; i++) ps[ds[i]] = i;
  //for (int i = 0; i < s; i++) printf("%d ", ps[i]); putchar('\n');

  memset(used, false, sizeof(used));
  ull m = 0;

  for (int i = 0; i < s; i++) {
    m += countunused(ps[i]) * fs[s - 1 - i];
    used[ps[i]] = true;
  }

  printf("%llu\n", m);
  return 0;
}