def prime_decomposition(x):
    ret = []
    for i in range(1, int(x**0.5)+1):
        if x%i==0:
            ret.append(i)
            if i!=x//i:
                ret.append(x//i)
    return sorted(ret)

a,b = map(int,input().split())
l = prime_decomposition(a)
flg = False
for x in l:
    if x%b==0:
        flg = True
        break
print('YES' if flg else 'NO')