-
Notifications
You must be signed in to change notification settings - Fork 0
/
292B.cpp
43 lines (41 loc) · 1.09 KB
/
292B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
// Rodrigo Farias de Macêdo
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define SZ(S) ((int) ((S).size()))
#define DEBUG(x) { cout << #x << " = " << x << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { REP(_,n) cout << a[_] << ' '; cout << endl; }
int boy[105], girl[105];
int m, n, a, b, aux;
int main() {
cin >> n >> m;
cin >> a;
REP(i, a){
cin >> aux;
boy[aux] = 1;
}
cin >> b;
REP(i, b){
cin >> aux;
girl[aux] = 1;
}
REP(i, 10000){
boy[i%n] = girl[i%m] = boy[i%n] || girl[i%m];
}
bool ans = true;
REP(i, n){
ans &= boy[i];
if(!ans) break;
}
REP(i, m){
ans &= girl[i];
if(!ans) break;
}
(ans ? cout << "Yes" << endl : cout << "No" << endl);
return 0;
}