/* -*- coding: utf-8 -*-
 *
 * 1458.cc:  No.1458 Segment Function - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_L = 200000;
const int INF = 1 << 30;

const int fs[] = { 6, 2, 5, 5, 4, 5, 6, 4, 7, 6 };
//                 0, 1, 2, 3, 4, 5, 6, 7, 8, 9

/* typedef */

/* global variables */

char p[MAX_L + 4], q[MAX_L + 4];

/* subroutines */

int f(char s[]) {
  int sum = 0;
  for (int i = 0; s[i]; i++) {
    if (s[i] == '-') sum++;
    else sum += fs[s[i] - '0'];
  }
  return sum;
}

int f(int x) { // x > 0
  int sum = 0;
  while (x > 0) {
    sum += fs[x % 10];
    x /= 10;
  }
  return sum;
}

/* main */

int main() {
  scanf("%s%s", p, q);
  int ql = strlen(q);

  if (ql == 1 && q[0] == '0') { puts(p); return 0; }

  int n = (ql >= 9) ? INF : atoi(q);
  //printf("n=%d\n", n);

  int x = f(p);
  n--;
  //printf("f(%s)=%d\n", p, x);

  for (; n > 0; n--) {
    int y = f(x);
    if (x == y) break;
    x = y;
  }

  printf("%d\n", x);
  return 0;
}