#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

class BIT{
public:
  ll n,bit[111];
  BIT(){fill(bit,bit+111,0);}
  void add(ll i,ll x){
    while(i<=n){
      bit[i]+=x;
      i+=i&-i;
    }
  }
  ll sum(ll i){
    ll s=0;
    while(i>0){
      s+=bit[i];
      i-=i&-i;
    }
    return s;
  }
};

BIT b=BIT();

ll calc(vector<ll> a) {
  ll n=a.size();
  b.n=n+1;
  REP(i,1,n+1) b.add(i,1);
  ll d[n+2];
  d[0]=1;
  rep(i,n+1) d[i+1]=d[i]*(i+1);
  ll ans=0;
  rep(i,n) {
    ans+=d[n-i-1]*b.sum(a[i]-1);
    b.add(a[i],-1);
  }
  return ans;
}

void Main() {
  ll n,m;
  cin >> m >> n;
  b.n=n+1;
  REP(i,1,n+1) b.add(i,1);
  ll d[n+2];
  d[0]=1;
  rep(i,n+1) d[i+1]=d[i]*(i+1);
  vector<ll> a(n);
  bool u[n];
  mem(u);
  rep(i,n) {
    rrep(j,n) {
      if(u[j]) continue;
      ll c=d[n-i-1]*b.sum(j);
      if(m>=c) {
        m-=c;
        u[j]=1;
        a[i]=j+1;
        b.add(a[i],-1);
        break;
      }
    }
  }
  vector<P> p(n);
  rep(i,n) p[i]=P(a[i],i+1);
  sort(all(p));
  vector<ll> b(n);
  rep(i,n) b[i]=p[i].S;
  pr(calc(b));
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}