import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

def solve(P,x):
    lis=[6,2,5,5,4,5,6,4,7,6]
    if x==0:
        return P
    elif P>=10:
        plis=list(map(int, list(str(P))))
        return solve(sum(solve(PP,1) for PP in plis),x-1)
    elif P<=-1:
        plis=list(map(int, list(str(abs(P)))))
        return solve(sum(solve(PP,1) for PP in plis)+1,x-1)
    elif x>100:
        return solve(P,100)
    else:
        return solve(lis[P],x-1)



def main():
    mod = 10**9+7
    mod2 = 998244353
    print(solve(*list(map(int, input().split()))))
        
     


if __name__ == '__main__':
    main()