def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

A, B = map(int, input().split())

A_div = make_divisors(A)

for i in range(len(A_div)):
    if A_div[i] % B == 0:
        print("YES")
        exit()
        
print("NO")