#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  ll a, b;
  cin >> a >> b;
  set<int> se;
  a %= b;
  if(a == 0){
    cout << "No" << endl;
    return 0;
  }
  while(1){
    ll add = a;
    rep(i, 9){
      a += add;
      a %= b;
    }
    if(se.find(a) != se.end()){
      cout << "Yes" << endl;
      return 0;
    }
    se.insert(a);
    a %= b;
    if(a == 0) break;
  }
  cout << "No" << endl;
  return 0;
}