#include <bits/stdc++.h>
using namespace std;
class UnionFind {
  int *c;
  vector<int> *v;
  set<int> happy;

 public:
  UnionFind(int n, int m) {
    v = new vector<int>[n + m];
    c = new int[n + m];
    for (int i = 0; i < n + m; i++) {
      v[i].push_back(i);
      c[i] = i;
    }
    int s;
    cin >> s;
    for (int i = 0; i < s; i++) {
      int t;
      cin >> t;
      happy.insert(t);
    }
    cin >> s;
    for (int i = 0; i < s; i++) {
      int t;
      cin >> t;
      happy.insert(t + n);
    }
  }
  void Union(int i, int j) {
    if (c[i] == c[j]) {
      return;
    }
    int c1 = c[i];
    int c2 = c[j];
    int n1 = v[c1].size();
    int n2 = v[c2].size();
    if (n1 <= n2) {
      for (int i = 0; i < v[c1].size(); i++) {
        c[v[c1][i]] = c2;
        v[c2].push_back(v[c1][i]);
      }
      v[c1].resize(1);
    } else {
      for (int i = 0; i < v[c2].size(); i++) {
        c[v[c2][i]] = c1;
        v[c1].push_back(v[c2][i]);
      }
      v[c2].resize(1);
    }
  }
  bool getAns(int n) {
    for (int i = 0; i < n; i++) {
      if (v[i].size() > 1) {
        bool flag = 0;
        for (int j = 0; j < v[i].size(); j++) {
          if (happy.find(v[i][j]) != happy.end()) {
            flag = 1;
            break;
          }
        }
        if (!flag) return 0;
      }
    }
    return 1;
  }
};
int main() {
  int n, m;
  cin >> n >> m;
  UnionFind u(n, m);
  u.Union(0, n);
  for (int i = 1;; i++) {
    int b = i % n;
    int g = i % m + n;
    if (b == 0 && g == n) {
      break;
    }
    u.Union(b, g);
  }
  if (u.getAns(n + m)) {
    cout << "Yes";
  } else {
    cout << "No";
  }
}
