A

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 x1, x2, ..., xb (0 ≤ xi < 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 y1, y2, ... , yg (0 ≤ yj < 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".

Example
Input

2 301 0OutputYesInput2 41 01 2OutputNoInput2 31 01 1OutputYes

Note

By we define the remainder of integer division of i by k.In first sample case:    On the 0-th day, Drazil invites 0-th boy and 0-th girl. Because 0-th girl is happy at the beginning, 0-th boy become happy at this day.    On the 1-st day, Drazil invites 1-st boy and 1-st girl. They are both unhappy, so nothing changes at this day.    On the 2-nd day, Drazil invites 0-th boy and 2-nd girl. Because 0-th boy is already happy he makes 2-nd girl become happy at this day.    On the 3-rd day, Drazil invites 1-st boy and 0-th girl. 0-th girl is happy, so she makes 1-st boy happy.    On the 4-th day, Drazil invites 0-th boy and 1-st girl. 0-th boy is happy, so he makes the 1-st girl happy. So, all friends become happy at this moment.

因为数据比较小。可以直接暴力求解，即判断 if(boy[i%n]==1&&girl[i%m]==0){
girl[i%m]=1;
}
else if(boy[i%n]==0&&girl[i%m]==1){
boy[i%n]=1;
}
最后再判断两个数组中为1的个数是否等于n和m

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int boy[105],girl[105];int main(){    int n,m,b,g,x,y;    scanf("%d%d",&n,&m);    scanf("%d",&b);    for(int i=0;i<b;i++){        scanf("%d",&x);        boy[x]=1;    }    scanf("%d",&g);    for(int j=0;j<g;j++){        scanf("%d",&y);        girl[y]=1;    }    for(int i=0;i<10000;i++){        if(boy[i%n]==1&&girl[i%m]==0){            girl[i%m]=1;        }        else if(boy[i%n]==0&&girl[i%m]==1){            boy[i%n]=1;        }    }    int i,j;    for(i=0;i<n&&boy[i]==1;i++);    for(j=0;j<m&&girl[j]==1;j++);    if(i==n&&j==m)        printf("Yes\n");    else        printf("No\n");        return 0;}