#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

template<typename T>struct BIT{
   int n; T m=0; vector<T> val;
   BIT(int _n):n(_n),val(_n+10){}
   void clear(){val.assign(n+10,0); m=0;}
   void add(int i,T x){
      for(i++;i<=n;i+=(i&-i))val[i]+=x;
      m+=x;
   }
   T sum(int i){
      T res=0;
      for(i++;i;i-=(i&-i))res+=val[i];
      return res;
   }
};

int main(){
   ll id; int n;
   cin>>id>>n;
   ll fact[25];
   fact[0]=1;
   rep(i,0,20)fact[i+1]=fact[i]*(i+1);
   vector<int> a(n),used(n,0);
   rep(i,0,n){
      ll cnt=id/fact[n-i-1];
      id-=cnt*fact[n-i-1];
      int val=1;
      while(1){
         if(used[val]){
            val++; continue;
         }
         if(cnt==0)break;
         cnt--;
         val++;
      }
      a[i]=val; used[val]=1;
   }

   for(auto& x:a)cerr<<x<<' ';
   cerr<<'\n';
   vector<int> b(n);
   rep(i,0,n)b[a[i]-1]=i+1;

   a=b;
   ll res=0; BIT<int> bit(n+1);
   rep(i,0,n){
      res+=fact[n-i-1]*(a[i]-1-bit.sum(a[i]));
      bit.add(a[i],1);
   }
   cout<<res<<endl;
   return 0;
}