#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using unit = unsigned;
using vl = vector<ll>;
using ull = unsigned long long;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vp = vector<pii>;
void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}
template <class T>
string join(const vector<T> &v) {
  stringstream s;
  for (int i = (int)(0); i < (int)(((long long)(v).size())); ++i)
    s << ' ' << v[i];
  return s.str().substr(1);
}
template <class T>
istream &operator>>(istream &i, vector<T> &v) {
  for (auto &x : v) {
    i >> v;
  }
  return i;
}
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v) {
  o << "[";
  for (auto &x : v) o << x << ",";
  o << "]";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const deque<T> &v) {
  o << "deq[";
  for (auto &x : v) o << x << ",";
  o << "]";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const set<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_set<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const multiset<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_multiset<T> &v) {
  o << "{";
  for (auto &x : v) o << x << ",";
  o << "}";
  return o;
}
template <class T1, class T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
  o << "(" << p.first << "," << p.second << ")";
  return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const map<TK, TV> &m) {
  o << "{";
  for (auto &x : m) o << x.first << "=>" << x.second << ",";
  o << "}";
  return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const unordered_map<TK, TV> &m) {
  o << "{";
  for (auto &x : m) o << x.first << "=>" << x.second << ",";
  o << "}";
  return o;
}
template <class T>
void YES(T c) {
  if (c)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
template <class T>
void Yes(T c) {
  if (c)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T>
void POSS(T c) {
  if (c)
    cout << "POSSIBLE" << endl;
  else
    cout << "IMPOSSIBLE" << endl;
}
template <class T>
void Poss(T c) {
  if (c)
    cout << "Possible" << endl;
  else
    cout << "Impossible" << endl;
}
template <class T>
void chmax(T &a, const T &b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, const T &b) {
  if (b < a) a = b;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = 1001002003;
const ll LINF = 1001002003004005006LL;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
                             const Iterator last) {
  if ((first == last) || (first == k) || (last == k)) return false;
  Iterator itr1 = first;
  Iterator itr2 = last;
  ++itr1;
  if (last == itr1) return false;
  itr1 = last;
  --itr1;
  itr1 = k;
  --itr2;
  while (first != itr1) {
    if (*--itr1 < *itr2) {
      Iterator j = k;
      while (!(*itr1 < *j)) ++j;
      iter_swap(itr1, j);
      ++itr1;
      ++j;
      itr2 = k;
      rotate(itr1, j, last);
      while (last != j) {
        ++j;
        ++itr2;
      }
      rotate(k, itr2, last);
      return true;
    }
  }
  rotate(first, k, last);
  return false;
}
void _main() {
  string s;
  int k;
  cin >> s >> k;
  int n = ((long long)(s).size());
  vi a(n);
  for (int i = (int)(0); i < (int)(n); ++i) a[i] = s[i] - '0';
  vi flag(n);
  iota((flag).begin(), (flag).end(), 0);
  ll ans = 0;
  vi tmpv(k);
  do {
    tmpv.assign(flag.begin(), flag.begin() + k);
    sort((tmpv).begin(), (tmpv).end());
    if (tmpv[0] == 0) {
      int tmp = 1;
      for (int i = (int)(1); i < (int)(k); ++i) {
        if (1 < flag[i] - flag[i - 1])
          tmp *= 9;
        else
          tmp *= a[tmpv[i]];
      }
      ans += tmp;
      if (k == 1) continue;
      tmp = a[0] == 1 ? 1 : a[0] - 1;
      for (int i = (int)(1); i < (int)(k); ++i) tmp *= 9;
      ans += tmp;
    } else {
      int tmp = 1;
      for (int i = (int)(0); i < (int)(k); ++i) tmp *= 9;
      ans += tmp;
    }
  } while (next_combination(flag.begin(), flag.begin() + k, flag.end()));
  cout << ans << endl;
}
