#include #include using mint = atcoder::static_modint<998244353>; //using mint = atcoder::static_modint<1000000007>; using namespace std; using namespace atcoder; using ld = long double; using ll = long long; #define mp(a,b) make_pair(a,b) #define rep(i,s,n) for(int i=s; i dx{1,0,-1,0},dy{0,1,0,-1}; template void compress(vector&a, bool is_unique=false){ auto b=a; sort(b.begin(),b.end()); if(is_unique){ auto p=unique(b.begin(),b.end()); b.erase(p,b.end()); } for(auto&x:a)x=lower_bound(b.begin(),b.end(),x)-b.begin(); } int main(){ int a,b; cin >> a >> b; vector t(a),s(b); rep(i,0,a)cin >> t[i]; rep(i,0,b)cin >> s[i]; int g=t[0]; for(auto x:t)g=gcd(g,x); string ans="Yes"; rep(i,0,b)if(s[i]%g!=0)ans="No"; cout << ans; }