#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using vi = vector; using vvi = vector; using vvvi = vector; using ve = vector>; using vb = vector; using vvb = vector; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define sz(c) ((ll)(c).size()) #define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin()) #define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin()) // #define MOD 1000000007 #define MOD 998244353 templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,vector&v){for(int i = 0;i < v.size();i++)os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.first>>p.second;return is;} template inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;} template inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;} ld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} int main(){ ios_base::sync_with_stdio(0), cin.tie(0); ll n,K;cin >> n >> K; vi rui(20,1); vi dig(20); auto calc = [](vi &dig,vi &rui,ll n){ rep(i,19){ rui[i+1] = rui[i]*(n%10 + 1); dig[i] = n%10; n /= 10; } };calc(dig,rui,n); ll res = 0; for(int i = 19;i >= 0;i--){ ll k = 0,J = 0; rep(j,dig[i]+1){ if(K <= k+rui[i]){ J = j;break; } k += rui[i]; } res = res*10 + J; K -= k; } cout << res << "\n"; // cout << rui << " a\n"; // cout << dig <<" b\n"; return 0; }