#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)

int main() {
  int a, b;
  cin >> a >> b;
  vector<int> t(a), s(b);
  rep(i, a)
    cin >> t[i];
  rep(i, b)
    cin >> s[i];
  sort(t.begin(), t.end());
  vector<int> tDif;
  int tOdd = 0, tEven = 0;
  rep(i, a) {
    if (t[i] % 2 == 0)
      tEven++;
    else
      tOdd++;
    if (i > 0) {
      if (t[i] != t[i-1])
	tDif.push_back(abs(t[i] - t[i-1]));
    }
  }
  sort(tDif.begin(), tDif.end());
  bool ans = true;
  rep(i, b) {
    if ((int)tDif.size() == 0) {
      if (s[i] % t[0] != 0)
	ans = false;
    } else {
      if (s[i] % t[0] != 0 && s[i] % tDif[0] != 0)
	ans = false;
    }
  }
  if (ans)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}