/* -*- coding: utf-8 -*-
 *
 * 2865.cc:  No.2865 Base 10 Subsets 2 - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_M = 20;

/* typedef */

using ll = long long;

/* global variables */

int as[MAX_M], bs[MAX_M];
ll ts[MAX_M];

/* subroutines */

/* main */

int main() {
  ll n, k;
  scanf("%lld%lld", &n, &k);
  k--;

  int m = 0;
  while (n > 0) as[m++] = n % 10, n /= 10;
  
  ts[0] = 1;
  for (int i = 1; i < m; i++) ts[i] = ts[i - 1] * (as[i - 1] + 1);

  for (int i = m - 1; i >= 0; i--) {
    bs[i] = k / ts[i];
    k -= ts[i] * bs[i];
  }

  while (m > 0 && bs[m - 1] == 0) m--;

  if (m == 0) puts("0");
  else {
    for (int i = m - 1; i >= 0; i--) printf("%d", bs[i]);
    putchar('\n');
  }
  
  return 0;
}