#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int A[10] = { 6,2,5,5,4,5,6,4,7,6 };
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string P, N;
	cin >> P >> N;
	if ("0" == N) { 
		cout << P << endl; 
		return 0; 
	}
	int pN = 0;
	rep(i, P.size()) {
		if ('-' == P[i]) {
			pN++; 
			continue; 
		}
		pN += A[P[i] - '0'];
	}
	int nN = INF;
	if (N.size() <= 9) { 
		nN = atoi(N.c_str()) - 1;
	}
	while (nN--) {
		int newP = 0;
		int copyP = pN;
		while (copyP) {
			newP += A[copyP % 10];
			copyP /= 10;
		}
		if (pN == newP) break;
		pN = newP;
	}
	cout << pN << endl;
	return 0;
}