Limak is a smart brown bear who loves chemistry, reactions and transforming elements. In Bearland (Limak's home) there are n elements, numbered 1 through n . There are also special machines, that can transform elements. Each machine is described by two integers a i , b i representing two elements, not necessarily distinct. One can use a machine either to transform an element a i to b i or to transform b i to a i . Machines in Bearland aren't very resistant and each of them can be used at most once . It is possible that a i = b i and that many machines have the same pair a i , b i . Radewoosh is Limak's biggest enemy and rival. He wants to test Limak in the chemistry. They will meet tomorrow and both of them will bring all their machines. Limak has m machines but he doesn't know much about his enemy. They agreed Radewoosh will choose two distinct elements, let's denote them as x and y . Limak will be allowed to use both his and Radewoosh's machines. He may use zero or more (maybe even all) machines to achieve the goal, each machine at most once. Limak will start from an element x and his task will be to first get an element y and then to again get an element x — then we say that he succeeds . After that Radewoosh would agree that Limak knows the chemistry (and Radewoosh would go away). Radewoosh likes some particular non-empty set of favorite elements and he will choose x , y from that set. Limak doesn't know exactly which elements are in the set and also he doesn't know what machines Radewoosh has. Limak has heard q gossips (queries) though and each of them consists of Radewoosh's machines and favorite elements. For each gossip Limak wonders if he would be able to succeed tomorrow for every pair x , y chosen from the set of favorite elements. If yes then print " YES " (without the quotes). But if there exists a pair ( x , y ) from the given set that Limak wouldn't be able to succeed then you should print " NO " (without the quotes). The first line contains