import collections

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

def n_fact(N):
    c = collections.Counter(prime_factorize(N))
    return c

X,A,Y,B = map(int,input().split())
XP = n_fact(X)
YP = n_fact(Y)
for k,v in YP.items():
    if k not in XP:
        print("No")
        exit()
    if XP[k] * A < v * B:
        print("No")
        exit()
print("Yes")