# Input #######################################
N, M = list(map(int, input().split()))
# 1 1
# MAIN #######################################

if N % M == 0:
    print("No")
    exit()

def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)


x = gcd(N, M)

N = N // x
M = M // x


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a


x = prime_factorize(M)
x = set(x)

if all([i == 2 or i == 5 for i in x]):
    print("No")
else:
    print("Yes")

# END #######################################