from collections import defaultdict
N,X = list(map(int,input().split()))

def prime_factorize(n):
    # https://note.nkmk.me/python-prime-factorization/
    a = defaultdict(int)
    while n % 2 == 0:
        a[2] += 1
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a[f] += 1
            n //= f
        else:
            f += 2
    if n != 1:
        a[n] += 1
    return a

for p in range(10**6):
    if(p**(X+1) > N):break
    if(p**(X+1) == N):
        if(prime_factorize(p)[p] == 1):
            print("No")
            exit()

a = prime_factorize(N)
a[0] = 0
print("Yes" if max(a.values()) >= X else "No")