#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(long long i=0;i<n;++i)
#define rep1(i,n) for(long long i=1;i<=n;++i)
#define rrep(i,n) for(long long i=n-1;i>=0;--i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1.1e18;const lint inf=1.01e9;
constexpr int MOD=1000000007;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
map<long long,lint> GetPrimes(long long n){
  long long buf=n;
  map<long long,lint> res;
  for(long long i=2;i*i<=n;++i){
    while(buf%i==0){
      buf/=i;res[i]+=1;
    }
  }
  if(buf>1)res[buf]+=1;
  return res;
}
signed main(){
  lint x,y,a,b;cin>>x>>a>>y>>b;
  auto c=GetPrimes(x);auto d=GetPrimes(y);
  for(auto& e:c)e.second*=a;
  for(auto& e:d){
    e.second*=b;
    if(c[e.first]<e.second){
      cout<<"No"<<"\n";
      return 0;
    }
  }
  cout<<"Yes"<<"\n";
  return 0;
}