#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<int>>;
#define MAX 1000000

int main()
{
    ll a,b;
    cin >> a >> b;

    while(a>=b){
        a-=b;
    }
    if(a==0){
        No;
        return 0;
    }

    while(b%2==0){
        b/=2;
    }
        while(b%5==0){
            b/=5;
        }
    

    while(a%2==0){
        a/=2;
    }
    while(a%5==0){
        a/=5;
    }
    if(a==b){
        No;
        return 0;
    }else{
        if(a%b==0){
            No;
            return 0;
        }
    }
    if(b==1){
        No;
    }else{
        Yes;
    }
}