def solve(num):    tmp = num.index(max(num))    if tmp==0:         del num[num.index(min(num[1:]))]    else:        del num[num.index(min(num[:tmp]))]            while True:      li = raw_input()      if li:        n, m = map(lambda x:int(x), li.split())        num=list(str(n))       # print num        for i in xrange(1,m+1):            solve(num)        k=‘‘.join(num)        print int(k)    else: break