def main():
  x, a, y, b = map(int, input().split())
  def factorization(n):
    arr, I = [], []
    tmp = n 
    m = int(-(-n**0.5//1))+1
    for i in range(2, m):
      if tmp % i == 0:
        cnt = 0
        while tmp % i == 0:
          cnt += 1
          tmp //= i
        arr.append([i, cnt])
        I.append(i)
    if tmp != 1:
      arr.append([tmp, 1])
      I.append(tmp)
    if len(arr) == 0:
      arr.append([n, 1])
      I.append(n)
    return I, arr

  xi, X = factorization(x)
  yi, Y = factorization(y)
  xi = set(xi)

  for i in range(len(Y)):
    if yi[i] not in xi:
      print('No')
      exit()
    yy = Y[i][0]
    for j in range(len(X)):
      if yy == X[j][0]:
        if Y[i][1]*b > X[i][1]*a:
          print('No')
          exit()
  print('Yes')
main()