#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, k;
  cin >> n >> k;
  vector<ll> cnt(30, 0);
  {
    ll now = 1, rem = n, i = 0;
    while (rem >= 0) {
      cnt[i] = now;
      if (rem == 0)
        break;
      ll x = rem % 10;
      now *= x + 1;
      rem /= 10;
      i++;
    }
  }
  k--;
  ll ans = 0, b = 1;
  rep(i, 25) {
    if (cnt[i + 1] == 0) {
      break;
    }
    ll rem = k % cnt[i + 1];
    ans += (rem / cnt[i]) * b;
    if (cnt[i + 2] == 0) {
      break;
    }
    b *= 10;
    k -= rem;
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}