def count_zero(i, i1):
    b = ''
    g = 0
    N = i
    while N > 0:
        b = str(N % i1)
        if int(b) != 0:
            break
        N = N // i1
        g += 1
    return g


def ceil1(x):
    from math import ceil
    return ceil(x)


def log1(x, y):
    from math import log
    return log(x, y)


def main():
    N, Z = map(int, input().split())
    i1 = max(1, log1(N + 1, 2))
    r = 2 ** (max(Z, ceil1(log1(N + 1, 2))))
    l = max(N + 1, 2 ** Z)
    for i in range(l, r + 1):
        for i1 in range(2, ceil1(i ** (1. / Z)) + 1):
            g = count_zero(i, i1)
            if g >= Z:
                print(i)
                return


main()