//#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
typedef long long ll;
#define int ll
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
template<typename T> bool chmax(T &a, const T b) {if (a < b) {a = b; return true;} else return false; }
template<typename T> bool chmin(T &a, const T b) {if (a > b) {a = b; return true;} else return false; }
const int INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
map<int,int> prime_factor(int n) {
    map<int,int> ret;
    for(int i=2; i*i<=n;i++){
      while(n%i==0){
        ret[i]++;
        n/=i;
      }
    }
    if(n!=1)ret[n]=1;
    return ret;
  }

signed main() {
   cin.tie(0);
   ios_base::sync_with_stdio(false);
   cout << fixed << setprecision(20);

   int x,a,y,b;
   cin>>x>>a>>y>>b;
   auto xp = prime_factor(x);
   auto yp = prime_factor(y);
   for(auto &[k,v]:xp)v*=a;
   for(auto &[k,v]:yp)v*=b;
   bool ok = 1;
   for(auto [k,v]:yp){
       //cout<<k<<" "<<xp[k]<<" "<<v<<endl;
       if(xp[x]<v)ok=0;
   }
   cout << (!ok?"Yes":"No") <<"\n";
   return 0;
}