#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,s;cin >> n >>s;
    ll ans=1;
    rep(i,s-1)ans*=(i+1);
    ll tmp=ans;
    set<ll> st;rep(i,s)st.ins(i+1);
    vl v(s);
    ll cnt=s-1;
    rep(i,s){
        ll p=n/ans;
        //cout << p <<endl;
        auto x=st.begin();rep(j,p)x++;
        v[i]=*x;
        st.erase(x);
        if(cnt==0)break;
        n=n%ans;
        ans/=cnt;
        cnt--;
    }
    //rep(i,s)cout << v[i] <<" ";cout << endl;
    vl nv(s);
    rep(i,s)nv[v[i]-1]=i+1;
    //rep(i,s)cout << nv[i] <<" ";cout << endl;
    rep(i,s)st.insert(i+1);
    ll sum=0;
    rep(i,s-1){
        ll p;
        auto itr=st.begin();
        rep(j,s){
            if(*itr==nv[i]){p=j;break;}
            itr++;
        }
        sum+=tmp*p;
        st.erase(nv[i]);
        tmp/=(s-1-i);
    }
    cout << sum <<endl;
}