#include <bits/stdc++.h>
#define rep(i, ss, ee) for (int i = ss; i < ee; ++i)
using namespace std;
using ull = unsigned long long;
std::vector<ull> primes;

void eratosthenes(ull n) {
  vector<bool> sieve(n, 1);
  sieve[0] = sieve[1] = false;
  rep(i, 0, n) if (sieve[i]) for (int j = i + i; j < n; j += i) {
    sieve[j] = false;
  }
  rep(i, 2, sieve.size()) if (sieve[i]) primes.emplace_back(i);
}

bool isPrime(int n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  double sqrtn = sqrt(n);
  for (int i = 3; i <= sqrtn; i += 2)
    if (n % i == 0) return false;
  return true;
}

bool isInfinitedecimal(unsigned a, unsigned b) {
  if (b == 1 or b == 2 or b == 5) return false;
  if (a == b) return false;
  if (a % b == 0) return false;
  if (isPrime(b)) return true;
  eratosthenes(sqrt(b) + 1);
  for (auto p : primes) {
    if (p == 2 or p == 5) continue;
    if (b % p == 0) return true;
  }
  if (b % 2 == 0) return false;
  if (b % 5 == 0) return false;
  return false;
}

void solve() {
  ull a, b;
  cin >> a >> b;
  cout << ((isInfinitedecimal(a, b)) ? "Yes" : "No") << endl;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  getchar();
}