#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using Pii = pair<int, int>;
#define rep2(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) rep2(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

#define INF (ll)1e9

const int mod = 1e9 + 7;
const int di[4] = {0, 1, 0, -1};
const int dj[4] = {1, 0, -1, 0};

const int di2[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj2[8] = {1, 0, -1, 0, 1, -1, 1, -1};

bool get(int m, int h) {
  if(h % m == 0) return true;
  else return false;
}

int main() {
  int m, h;
  cin >> m >> h;
  if(get(m, h)) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int v,t,s,d,a,s1,flag=0;
    cin>>v>>t>>s>>d;
    a=v*t;
    for(int i=t; i<=s; i++)
    {


        if((d>=(v*i)&&(d<=(v*s))))
        {
            flag=1;
            break;
        }

    }
    if(flag==1)

    {
        cout<<"No"<<endl;
    }
    else
    {
        cout<<"Yes"<<endl;
    }
    return 0;
}
