B. Drazil and His Happy Friends

Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.

There are n boys and m girls among his friends. Let's number them from 0 to n - 1 and 0 to m - 1 separately. In i-th day, Drazil invites -th boy and -th girl to have dinner together (as Drazil is programmer, i starts from 0). If one of those two people is happy, the other one will also become happy. Otherwise, those two people remain in their states. Once a person becomes happy (or if he/she was happy originally), he stays happy forever.

Drazil wants to know whether he can use this plan to make all his friends become happy at some moment.

Input

The first line contains two integer n and m (1 ≤ n, m ≤ 100).

The second line contains integer b (0 ≤ b ≤ n), denoting the number of happy boys among friends of Drazil, and then follow b distinct integers x₁, x₂, ..., x_b (0 ≤ x_i < n), denoting the list of indices of happy boys.

The third line conatins integer g (0 ≤ g ≤ m), denoting the number of happy girls among friends of Drazil, and then follow g distinct integers y₁, y₂, ... , y_g (0 ≤ y_j < m), denoting the list of indices of happy girls.

It is guaranteed that there is at least one person that is unhappy among his friends.

Output

If Drazil can make all his friends become happy by this plan, print "Yes". Otherwise, print "No".

Examples

Input

Copy

2 3
0
1 0

Output

Copy

Yes

Input

Copy

2 4
1 0
1 2

Output

Copy

No

Input

Copy

2 3
1 0
1 1

Output

Copy

Yes

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

const int maxn=110;
int boy[maxn],girl[maxn];
/*
get_lcm(n,m)，这样的思想是不对的
比如说100 50
这样的话，我们只是说采取了所有可能的组合，但是呢
我们只是改变了一次，所以说再来一次，我感觉就可以了
因为第一次能改变的都已经改变了，
再来一次就已经是固定的了 
*/
int gcd(int a,int b){
	if(b>a) swap(a,b);
	return b==0?a:gcd(b,a%b);
}

int get_lcm(int n,int m){
	return n*m/gcd(n,m);
}
int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	int num_boy,num_girl;
	scanf("%d",&num_boy);
	for(int i=1;i<=num_boy;i++){
		int id;
		scanf("%d",&id);
		boy[id]=1;
	}
	scanf("%d",&num_girl);
	for(int i=1;i<=num_girl;i++){
		int id;
		scanf("%d",&id);
		girl[id]=1;
	}
	int max=2*get_lcm(n,m);
	for(int i=0;i<max;i++){
		int id_b=i%n,id_g=i%m;
		if(boy[id_b]||girl[id_g]){
			boy[id_b]=girl[id_g]=1;
		}
	}
	int wa=0;
	for(int i=0;i<n;i++){
		if(!boy[i])wa=1;
	}
	for(int i=0;i<m;i++){
		if(!girl[i])wa=1;
	}
	if(wa)
		printf("No\n");
	else
		printf("Yes\n");
	
	return 0;
}