#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

vector<pair<long long, long long>> prime_factorize(long long N){
    vector<pair<long long, long long>> res;
    for(long long a = 2; a * a <= N; ++a){
        if(N % a != 0) continue;
        long long ex = 0;
        while(N % a == 0) ++ex, N /= a;
        res.push_back({a,ex});
    }
    if(N != 1) res.push_back({N,1});
    return res;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll X,Y,A,B; cin >> X >> A >> Y >> B;
    auto pfX = prime_factorize(X);
    map<ll,ll> mp;
    for(auto &[p, e] : pfX) mp[p] = e * A;
    auto pfY = prime_factorize(Y);
    int ok = 1;
    for(auto &[p, e] : pfY)  ok &= mp[p] >= e * B;

    cout << (ok ? "Yes" : "No") << endl;
}