#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
bool paircomp(const pair<ll, ll> &a, const pair<ll, ll> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string S;
  ll K;
  cin >> S;
  cin >> K;
  ll N = S.size();
  vvl DP = vector<vector<ll>>(K + 2, vector<ll>(2, 0));
  DP[0][0] = 1;
  for (ll i = 0; i < (N); i++) {
    vvl NDP = vector<vector<ll>>(K + 2, vector<ll>(2, 0));
    for (ll j = 0; j < (K); j++) {
      if (S[i] == '0')
        NDP[j][0] += DP[j][0];
      else
        NDP[j][1] += DP[j][0];
      NDP[j][1] += DP[j][1];
      if (S[i] != '0') NDP[j + 1][1] += DP[j][0] * (S[i] - '1');
      if (S[i] != '0') NDP[j + 1][0] += DP[j][0];
      NDP[j + 1][1] += DP[j][1] * 9;
    }
    NDP[K][1] += DP[K][1];
    NDP[K][0] += DP[K][0];
    DP = NDP;
  }
  cout << DP[K][1] + 1 << endl;
  return 0;
}
