A9838 | 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.

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_{1},x_{2},...,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_{1},y_{2},...\ ,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.

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