#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

const int N_MAX = 10010;
ll Per[N_MAX] = {}; // n!
ll Per_inv[N_MAX] = {}; //(n!)^-1

ll nCr(ll n, ll r){
    if(n<r) return 0;
 
    if (n == r || r == 0)
        return 1;
    else
        return Per[n] * Per_inv[n-r] % mod * Per_inv[r] % mod;  
}
 
// a^b mod p
ll mod_pow(ll a, ll b){
    if(b==0) return 1;
 
    // 肩が奇数
    if(b%2==1){
        return a * mod_pow(a, b-1) % mod;
    }
    else{
        return mod_pow(a*a % mod, b/2) % mod;
    }
}

void prepare_nCr(){
    Per[0] = 1;
    Per_inv[0] = 1;

    // nCr高速化準備
    Per[1] = 1;
    FOR(i, 2, N_MAX){
        Per[i] = i * Per[i-1] % mod;
    }
    Per_inv[1] = 1;
    FOR(i, 2, N_MAX){
        Per_inv[i] = mod_pow(Per[i], mod-2);
    }
}

ll nHr(ll n, ll r){
  return nCr(n-1+r, n-1);
}

ll ll_pow(ll a, ll n){
    ll ans = 1;
    FOR(i, 0, n){
        ans *= a;
    }
    return ans;
}

ll not_zero_count(ll v){
  ll cnt=0;
  while(v!=0){
    if(v%10!=0){
      cnt++;
    }
    v /= 10;
  }
  return cnt;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    string s;cin>>s;
    ll K;cin>>K;

    prepare_nCr();
    
    ll L = s.size(); // keta

    if(L<5){
      debug("all search");
      // 全探索
      ll N = stoll(s);
      debug(N);
      ll cnt=0;
      FOR(v, 1, N+1){
        if(not_zero_count(v)==K){
          cnt++;
        }
      }
      p(cnt);
      return 0;
    }

    ll ans = 0;

    debug(L);
    // 桁数が小さいやつ
    FOR(keta, K, L){
      if(keta==1){
        ans += 9;
        continue;
      }

      // easy
      debug(keta);
      ans += 9 * nCr(keta-1, K-1) * ll_pow(9, K-1);
      debug(nCr(keta-1, K-1));
    }
    debug("keta lower", ans);

    // keta == L
    // 全部作る
    stringstream ss;
    rep(i, L) ss<<0;
    string a = ss.str();
    debug(a);

    FOR(i, 1, 10){
      string b = a;
      b[0] = '0' + i;
      // debug(b);

      if(K-1==0){
        if(b<=s) ans++;
        continue;
      }

      // のこりのけたをうめる
      VI V(L-1, 0);
      rep(i, K-1) V[i] = 1;
      SORT(V);
      // debug(V);

      do{
        VI I; // insert
        rep(i, V.size()){
          if(V[i]==1) I.push_back(i);
        }
        // 場所が決まった
        if(K-1==1){
          FOR(j, 1, 10){
            b[L-1-I[0]] = '0'+j;
            // debug(b);
            if(b<=s) ans++;
            b[L-1-I[0]] = '0'; //もどす
          }
        }
        else{
          // K-1==2
          FOR(j, 1, 10){
            FOR(k, 1, 10){
              b[L-1-I[0]] = '0'+j;
              b[L-1-I[1]] = '0'+k;
              // debug(b);
              if(b<=s) ans++;
              b[L-1-I[0]] = '0'; //もどす 
              b[L-1-I[1]] = '0'; //もどす           
            }
          }
        }
      }while(next_permutation(ALL(V)));
    }
    p(ans);

    return 0;
}

Measured memory_bytes: 384