#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

using LL = __int128;
istream& operator>>(istream& is, LL& v)
{
    string s;
    is >> s;
    v = 0;
    for (int i = 0; i < (int)s.size(); i++) {
        if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }
    }
    if (s[0] == '-') { v *= -1; }
    return is;
}
 
ostream& operator<<(ostream& os, const LL& v)
{
    if (v == 0) { return (os << "0"); }
    LL num = v;
    if (v < 0) {
        os << '-';
        num = -num;
    }
    string s;
    for (; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }
    reverse(s.begin(), s.end());
    return (os << s);
}

LL parse(string &s) {
  LL ret = 0;
  for (int i = 0; i < (int)s.length(); i++)
    if ('0' <= s[i] && s[i] <= '9')
      ret = 10 * ret + s[i] - '0';
  return ret;
}

int main(){

    string X;
    cin >> X;
    ll M;
    cin >> M;

    ll N = X.size();

    if(N == 1){
        ll x = X[0] - '0';
        if(x <= M){
            cout << 1 << endl;
        }else{
            cout << 0 << endl;
        }
        return 0;
    }

    ll d = 0;
    for(auto x: X){
        chmax(d, ll(x - '0'));
    }

    ll ok = d;
    ll ng = (ll)1e18+1;

    while(ng-ok > 1){
        ll md = (ok+ng)/2;
        LL res = 0;
        string ma = "1000000000000000005";
        LL MA = parse(ma);

        REP(i, N){
            if(res >= MA){
                ng = md;
                goto HELL;
            }
            res *= md;
            ll v = X[i] - '0';
            res += v;
        }

        if(res <= M) ok = md;
        else ng = md;

        HELL:;
    }

    cout << ok - d << endl;

    return 0;
}
#include<bits/stdc++.h>
using namespace std;
string x;
int d;
long long m,sum,cnt,rt;
long long calc(long long base){
	sum=0;
	for(int i=0;i<x.size();i++){
		if(sum>(m/base)) return m+1;
		sum*=base;
		sum+=(x[i]-'0');
		if(sum>m) return m+1;
	}
	return sum;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>x>>m;
	d=0;
	for(int i=0;i<x.size();i++) d=max(d,x[i]-'0');
	if(x.size()==1){
		if(x[0]-'0'<=m)
			cout<<1<<endl;
		else
			cout<<0<<endl;
		return 0;
	}
	if(m<=d){
		cout<<0<<endl;
		return 0;
	}
	if(x.size()==2){
		long long ri=(m-(long long)(x[1]-'0'))/(long long)(x[0]-'0');
		cout<<max(ri-d,0LL)<<endl;
		return 0;
	}
	if(x.size()==3){
		long long a=x[0]-'0',b=x[1]-'0',c=x[2]-'0';
		//an^2+bn+c
		long long le=d+1,ri=sqrt(m/a),mid,f;
		while(le<ri){
			mid=(le+ri+1)/2; 
			f=a*mid*mid+b*mid+c;
			if(f>m) ri=mid-1;
			else le=mid;
		}
		cout<<max(le-d,0LL)<<endl;
		return 0;
	}
	else{
		for(int i=d+1;;i++){
			rt=calc(i);
			if(rt>m) break;
			cnt++;
		}
		cout<<cnt<<endl;
		return 0;
	}
}

