Consider this example: James has three friends: Lucy, Sue, and Mark. James is friends with all three of them, but unfortunately he doesn’t have Mark’s phone number so he can’t invite him directly. However, Sue has Mark’s number (and vice versa) so she can invite Mark to James’s party.
The question that you need to answer is that if anyone lost one of the phone numbers for anyone else, would it be impossible to invite everybody to the party? Continuing the above example, if Sue lost Mark’s number (the edge denoted by the red arrow above), then it would not be possible to invite everybody to the party. You should assume that if Sue loses Mark’s number, then Mark will also lose Sue’s number. Please help James figure out if he is at risk at having someone miss his party if any pair of friends loses contact with each other.
The input will contain up to $10$ test cases. Each test case contains on a single line two integers $p$ ($1 \le p \le 100$) and $c$ ($0 \le c \le 5000$). $p$ represents the number of people James wants to invite to the party, including himself. The next $c$ lines represent the connections among James’s friends represented as two integers $a$ ($0 \le a < p$) and $b$ ($0 \le b < p$), where $a$ is not equal to $b$. This means that friend number $a$ has friend number $b$’s phone number and vice versa.
The input will be terminated by a line containing $2$ zeros. This case should not be processed.
For each test case, if a pair could lose each other’s numbers and make it so that not everybody can be invited to the party, print “Yes”. Otherwise, print “No”.
Sample Input 1 | Sample Output 1 |
---|---|
2 1 0 1 4 4 0 1 1 2 2 3 3 0 5 5 0 1 1 2 0 3 3 4 3 1 0 0 |
Yes No Yes |