#include using namespace std; using ll = long long; const long long MOD = 1e9+7; #define ALL(A) A.begin(),A.end() void ALLIN1_NUMBER(vector& V) { for(auto& x : V) { cin >> x; } } void ALLOUT_NUMBER(vector V) { ll N = V.size(); for(ll i=0;i= MOD) x -= MOD; return *this; } Mll& operator-=(const Mll& A) { if((x += MOD - A.x) >= MOD) x -= MOD; return *this; } Mll& operator*=(const Mll& A) { (x *= A.x) %= MOD; return *this; } Mll operator+(const Mll& A) { Mll res(*this); return res+=A; } Mll operator-(const Mll& A) { Mll res(*this); return res-=A; } Mll operator*(const Mll& A) { Mll res(*this); return res*=A; } Mll pow(ll t) const // t乗 { if(t==0) return 1; Mll A = pow(t>>1); A *= A; if(t&1) A *= *this; return A; } // for prime mod Mll inv() const { return pow(MOD-2); } Mll& operator/=(const Mll& A) { return (*this) *= A.inv(); } Mll operator/(const Mll& A) const { Mll res(*this); return res/=A; } friend ostream& operator<<(ostream& os, const Mll& M) { os << M.x; return os; } }; vector ALLIN_MLL(ll N) { vector numbers_ll(N); ALLIN1_NUMBER(numbers_ll); vector numbers_Mll; for(ll i=0;i par; UnionFind(ll n) : par(n) { for(ll i=0;i void OUT0(T N) { cout << N << endl; } static const double pi = acos(-1.0); double Cos(double D) { return cos(pi/180 * D); } vector RUI(ll N, vector IN) { vector ret(N+1); ret[0] = 0; for(ll i=1;i<=N;i++) { ret[i] = ret[i-1] + IN[i-1]; } return ret; } int main() { ll A,B; cin >> A >> B; for(ll i=1;i<=100;i++) { if(A%i==0 && i%B==0) { cout << "YES" << endl; return 0; } } cout << "NO" << endl; return 0; }