#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
  ll a, b;
  cin >> a >> b;
  int num = 0;
  while (num <= 1e5) {
    while (a < b) {
      a *= 10;
    }
    a = a % b;
    if (a == 0) {
      cout << "No" << endl;
      return 0;
    }
    num++;
  }
  cout << "Yes" << endl;
  return 0;
}