#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

map<ll, ll> primefactors(ll N) {
  map<ll, ll> res;
  for (ll i = 2; i * i <= N; i++) {
    while (N % i == 0) {
      res[i]++;
      N /= i;
    }
  }
  if (N != 1) res[N]++;
  return res;
}

int main() {
  ll X, A, Y, B; cin >> X >> A >> Y >> B;
  auto MX = primefactors(X);
  for (auto &p: MX) {
    p.second *= A;
  }
  auto MY = primefactors(Y);
  for (auto &p: MY) {
    p.second *= B;
  }
  for (auto &p: MY) {
    if (MX[p.first] < p.second) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  return 0;
}