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

using ll = long long;
using ull = unsigned long long;
#define v(t) vector<t>
#define p(t) pair<t, t>
#define p2(t, s) pair<t, s>
#define vp(t) v(p(t))

#define rep(i, n) for (int i=0,i##_len=((int)(n)); i<i##_len; ++i)
#define rep2(i, a, n) for (int i=((int)(a)),i##_len=((int)(n)); i<=i##_len; ++i)
#define repr(i, n) for (int i=((int)(n)-1); i>=0; --i)
#define rep2r(i, a, n) for (int i=((int)(n)),i##_len=((int)(a)); i>=i##_len; --i)

#define repi(itr, c) for (__typeof((c).begin()) itr=(c).begin(); itr!=(c).end(); ++itr)
#define repir(itr, c) for (__typeof((c).rbegin()) itr=(c).rbegin(); itr!=(c).rend(); ++itr)

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define eb emplace_back

#define INF (1e9)
#define LINF (1e18)
#define PI (acos(-1))
#define EPS (1e-7)
#define DEPS (1e-10)

const v(int) sval = { 6, 2, 5, 5, 4, 5, 6, 4, 7, 6 };

string s0;
map<p(int), int> memo;
int f1(int l, int r) {
    if (memo.find({l,r}) != memo.end()) return memo[{l,r}];
    string s1 = s0.substr(l, (r-l));
    if (s1.front() == '-') return (memo[{l,r}] = f1(l+1,r)+1);
    else if (sz(s1) == 1) return (memo[{l,r}] = sval[(int)(s1.front()-'0')]);
    else return (memo[{l,r}] = f1(l,l+1)+f1(l+1,r));
}

int f(string s) {
    if (s.front() == '-') return f(s.substr(1))+1;
    else if (sz(s) == 1) return sval[(int)(s.front()-'0')];
    else return f(s.substr(0,1))+f(s.substr(1));
}

ll mod = (ll)(1e9)+7;
// auto mod int
struct mint {
    ll x; // typedef long long ll;
    mint(ll x=0):x((x%mod+mod)%mod){}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
    mint operator+(const mint a) const { return mint(*this) += a;}
    mint operator-(const mint a) const { return mint(*this) -= a;}
    mint operator*(const mint a) const { return mint(*this) *= a;}
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }

    // for prime mod
    mint inv() const { return pow(mod-2);}
    mint& operator/=(const mint a) { return *this *= a.inv();}
    mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

int main(){
    string pi, n;
    cin >> pi >> n;
    if (sz(n)==1 && stoll(n)==0LL) {
        cout << pi << endl;
        return 0;
    }
    s0 = pi;
    ll now = f1(0, sz(pi));
    if (sz(n)==1 && stoll(n)==1LL) {
        cout << now << endl;
        return 0;
    }
    map<int, ll> cnt;
    cnt[now] = 1;
    ll icnt = 2, nval = -1;
    ll res = 0;
    if (sz(n) <= 18) nval = stoll(n);
    while (1) {
        int nxt = f(to_string(now));
        if (cnt.find(nxt) != cnt.end()) {
            ll roop = (icnt - cnt[nxt]);
            if (nval != -1) {
                nval = (nval - icnt) % roop;
            }
            else {
                mod = roop;
                mint nval2 = 0;
                rep(j, sz(n)) {
                    nval2 *= 10;
                    nval2 += (ll)(n[j] - '0');
                }
                nval2 -= icnt;
                nval = nval2.x;
            }
            res = nxt;
            rep(j, nval) res = f(to_string(res));
            break;
        }
        else cnt[nxt] = icnt;
        if (nval!=-1 && nval<=icnt) {
            res = nxt;
            break;
        }
        ++icnt;
        now = nxt;
    }
    cout << res << endl;
    return 0;
}