#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
map<ll,ll> factor(ll n){
  map<ll,ll> ret;
  ll p=n;
  for(ll i=2;i*i<=n;i++){
    while(p%i==0){
      ret[i]++;p/=i;
    }
  }
  if(p!=1)ret[p]++;
  return ret;
}
int main(){
  ll x,a,y,b;cin >> x >> a >> y >> b;
  auto fx=factor(x);
  auto fy=factor(y);
  for(auto p:fy){
    ll ans=p.second*b;
    ll ret=fx[p.first]*a;
    if(ans>ret){
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}