from collections import Counter

def prime_factorize(n): # O(√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, A, Y, B = map(int, input().split())
primesX = Counter(prime_factorize(X))
primesY = Counter(prime_factorize(Y))

for k, v in primesY.items():
    # primesX[k]*A が v*B 以上か？
    if primesX[k]*A >= v*B:
        continue
    else:
        exit(print('No'))

print('Yes')