#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
#define rrep(i, n) for (int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

__attribute__((unused)) const ll INF = 1e18;
__attribute__((unused)) const int Inf = 1e9;
__attribute__((unused)) const double EPS = 1e-9;
__attribute__((unused)) const ll MOD = 1000000007;

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

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(0);
  ll x, a, y, b;
  cin >> x >> a >> y >> b;
  auto xp = primeFactorize(x), yp = primeFactorize(y);
  for (auto& p : xp) {
    p.second *= a;
  }
  for (auto& p : yp) {
    p.second *= b;
    if (xp[p.first] < p.second) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;

  return 0;
}