//fake_name 
#include<bits/stdc++.h>
using namespace std ; 
#define int long long int 
#define F first 
#define S second 

int MOD = 998244353 ; 
int mod = 1e9 + 7 ; 
int inf = 1e18 ; 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

signed main() 
{
    ios_base::sync_with_stdio(false) ; 
    cin.tie(0) ; cout.tie(0) ; 
    int n , x ; 
    cin >> n >> x ; 
    for( int i = 0 ; i < n ; i++ ){
    	int y ; 
    	cin >> y ; 
    	if( y != x ) 
    		cout << y << ' ' ; 
    }
    cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long double ld;
/*
#include <chrono> 
using namespace std::chrono;
#include <boost/multiprecision/cpp_int.hpp> 
using namespace boost::multiprecision;
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
#define ordered_set tree<pair<lli,lli>, null_type,less<pair<lli,lli>>, rb_tree_tag,tree_order_statistics_node_update> 
*/
#define endl "\n"
#define pb push_back
const lli mod=1e9+7;
const lli mod1=998244353;
#define fir first
#define sec second
#define plli pair<lli,lli>
/*
lli power(lli a, lli b) {
    lli res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
lli powermod(lli a, lli b) 
{
    lli res = 1;
    while (b > 0) {
        if (b & 1)
            res = ((res%mod)*(a%mod))%mod;
        a = (a * a)%mod;
        b >>= 1;
    }
    return res;
}
*/
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    lli T;
    T=1;
    //cin>>T;
    while(T--)
    {
        lli n,m;
        cin>>n>>m;
        if(m%n==0)
            cout<<"Yes\n";
        else
            cout<<"No\n";
    }   
    return 0;
}
















