//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
}  // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans


void solve() {
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    string A, B;
    cin >> A >> B;
    auto f = [](string s) {
        int ret = 0;
        for (int i = 0; i < 3; i++) {
            ret += s[i] - '0';
        }
        return ret;
    };
    cout << max(f(A), f(B)) << endl;

    solve();
    return 0;
}

#include <iostream>
#include <cmath>
using namespace std;
typedef unsigned long long ll;

ll check(string ip, ll base, ll m){
    ll ans =0;
    ll curr = 0;
    for(int i =ip.length()-1;i>=0;i--){
		if(ans<0 || pow(base,curr)>m) return m+1;
		
        ans+= (ll)((int)ip[i]-'0')*pow(base,curr);
        curr++;
        if(ans>m){
        	//cout<<"ans"<<ans<<endl;
        	return m+1;
        	
        }
    }
    return ans;
}

int main ()
{
  string X;
  cin>>X;
  ll M;
  cin>>M;
  if(X.length()==1){
  	if(stoi(X)<=M) cout<<"1";
  	else cout<<"0";
  	return 0;
  }
  int mx =-1;
  for(char a: X){
      mx = max(mx,(int)a-'0');
  }
  ll low = mx+1, high = M;
  ll ans=mx;
  while(low<=high){
      ll mid = low + (high-low)/2;
      //cout<<"low:"<<low<<" mid:"<<mid<<" high:"<<high<<endl;
      //cout<<"check:"<<check(X,mid,M)<<endl;
      
      if(check(X,mid,M)<=M){
          low = mid+1;
          ans = max(ans,mid);
      }
      else{
          high = mid-1;
      }
  }
  //cout<<"ans:"<<ans<<" mx:"<<mx<<endl;
  cout<<max((ll)0,ans-mx);
  return 0;
}
