x_str = input()
k = int(input())
x = int(x_str)
x_sorted = sorted(x_str)
x_set = set(x_str)
if k == 0:
    if len(x_set) == 1:
        print(x)
    elif x_str[0] == x_sorted[-1] or int(x_str[1]) < int(x_str[0]):
        print(x_str[0] * len(x_sorted))
    else:
        print(str(int(x_str[0]) + 1) * len(x_sorted))
else:
    if len(x_sorted) <= 2:
        print(x)
    elif x_sorted[1] == x_sorted[-1] or x_sorted[0] == x_sorted[-2]:
        print(x)
    else:
        variants = []
        for i in range(10):
            new_number = int(x_str[0] + str(i) * (len(x_sorted) - 1))
            print(new_number)
            if new_number >= x:
                variants.append(new_number)
        for position in range(1, len(x_sorted)):
            for i in range(10):
                new_number = int(x_str[0] * position + str(i) + x_str[0] * (len(x_sorted) - position - 1))
                print(new_number)
                if new_number >= x:
                    variants.append(new_number)
        print(variants)
        print(min(variants))