#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
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...);
}
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;
}
void no() {
  cout << ("NO") << '\n';
  exit(0);
}
void yes() {
  cout << ("YES") << '\n';
  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] = {};
ll Per_inv[N_MAX] = {};
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;
}
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;
  Per[1] = 1;
  for (ll i = (2); i < (N_MAX); ++i) {
    Per[i] = i * Per[i - 1] % mod;
  }
  Per_inv[1] = 1;
  for (ll i = (2); i < (N_MAX); ++i) {
    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 (ll i = (0); i < (n); ++i) {
    ans *= a;
  }
  return ans;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  ll K;
  cin >> K;
  prepare_nCr();
  ll L = s.size();
  ll ans = 0;
  42;
  for (ll keta = (K); keta < (L); ++keta) {
    if (keta == 1) {
      ans += 9;
      continue;
    }
    42;
    ans += 9 * nCr(keta - 1, K - 1) * ll_pow(9, K - 1);
    42;
  }
  42;
  stringstream ss;
  for (ll i = (0); i < (L); ++i) ss << 0;
  string a = ss.str();
  42;
  for (ll i = (1); i < (10); ++i) {
    string b = a;
    b[0] = '0' + i;
    if (K - 1 == 0) {
      if (b <= s) ans++;
      continue;
    }
    VI V(L - 1, 0);
    for (ll i = (0); i < (K - 1); ++i) V[i] = 1;
    sort((V).begin(), (V).end());
    do {
      VI I;
      for (ll i = (0); i < (V.size()); ++i) {
        if (V[i] == 1) I.push_back(i);
      }
      if (K - 1 == 1) {
        for (ll j = (1); j < (10); ++j) {
          b[L - 1 - I[0]] = '0' + j;
          if (b <= s) ans++;
          b[L - 1 - I[0]] = '0';
        }
      } else {
        for (ll j = (1); j < (10); ++j) {
          for (ll k = (1); k < (10); ++k) {
            b[L - 1 - I[0]] = '0' + j;
            b[L - 1 - I[1]] = '0' + k;
            if (b <= s) ans++;
            b[L - 1 - I[0]] = '0';
            b[L - 1 - I[1]] = '0';
          }
        }
      }
    } while (next_permutation((V).begin(), (V).end()));
  }
  cout << (ans) << '\n';
  return 0;
}
