#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;



void solve(){
    map<ll,ll>ma;
    ll x,y,a,b;cin>>x>>a>>y>>b;
    REP(i,2,sqrt(x)+1){
        if(x%i==0){
            ll p=i;
            while(x%p==0){
                x/=p;
                ma[p]++;
            }
        }
    }
    if(x>1)ma[x]++;
    bool f=1;
    REP(i,2,sqrt(y)+1){
        if(y%i==0){
            ll cnt=0;
            ll p=i;
            while(y%p==0){
                y/=p;
                cnt++;
            }
            if(cnt*b>ma[p]*a)f=0;
        }
    }
    if(y>1){
        if(ma[y]*a<b)f=0;
    }
    cout<<(f?"Yes":"No")<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}