def factorization(n):
    arr = dict()
    temp = n
    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr[i] = cnt

    if temp != 1:
        arr[temp] = 1

    if not arr and n != 1:
        arr[n] = 1

    return arr


def solve(X, Y, A, B):
    fX = factorization(X)
    fY = factorization(Y)

    for k, v in fY.items():
        if fX.get(k, 0) * A < v * B:
            return False
    return True


X, A, Y, B = map(int, input().split())
print('Yes' if solve(X, Y, A, B) else 'No')