#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

map<ll, int> pf(ll x) {
    map<ll, int> ret;
    for (ll i = 2; i * i <= x; i++) {
        int y = 0;
        while (x % i == 0) {
            y++;
            x /= i;
        }
        if (y > 0) ret[i] = y;
    }
    if (x > 1) ret[x]++;
    return ret;
}

int main() {
    ll X, A, Y, B;
    cin >> X >> A >> Y >> B;
    auto C = pf(X), D = pf(Y);
    string ans = "Yes\n";
    //for (auto i : C) cout << i.first << " " << i.second << endl;
    //for (auto i : D) cout << i.first << " " << i.second << endl;
    for (auto i : D) {
        if (B * i.second > A * C[i.first]) ans = "No\n";
        //cout << i.second << " " << C[i.first] << endl;
    }
    cout << ans;
}