#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

string S;
long long N;
long long A[10] = { 6, 2, 5, 5, 4, 5, 6, 4, 7, 6 };
long long nex[1 << 22];
long long vis[1 << 22];

void init() {
	for (int i = 0; i <= 2000000; i++) {
		string I = to_string(i);
		int cnt = 0;
		for (int j = 0; j < I.size(); j++) cnt += A[I[j] - '0'];
		nex[i] = cnt;
	}
}

int main() {
	cin >> S >> N;
	init();

	if (N == 0) {
		cout << S << endl;
	}
	else {
		long long wa = 0;
		for (int i = 0; i < S.size(); i++) {
			if (S[i] == '-') wa += 1;
			else wa += A[S[i] - '0'];
		}
		N -= 1;
		for (int i = 0; i < (1 << 22); i++) vis[i] = -1;

		int cx = wa, cnt = 0;
		vector<int> vec;
		for (int t = 0; t < N; t++) {
			vec.push_back(cx);
			if (vis[cx] != -1) {
				long long loops = t - vis[cx];
				long long r = vis[cx] + (N - vis[cx]) % loops;
				cout << vec[r] << endl;
				return 0;
			}
			vis[cx] = t;
			cx = nex[cx];
		}
		cout << cx << endl;
	}
	return 0;
}