{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eDenis, Eugene and Misha take professional approach to ACM ICPC. They\r\ndon\u0027t have any common interests and communicate with each other only\r\nduring the competitions. Recently they arrived in Saint Petersburg to\r\nparticipate in the regional contest and haven\u0027t seen each other yet.\r\nAt morning before the contest they will leave their hotel at different times\r\nand will go to the contest site, Anichkov palace. Help them find out\r\nif there are such three paths from the hotel to Anichkov palace, that\r\nno two of them share a common road segment.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line contains integers \u003ci\u003en\u003c/i\u003e and \u003ci\u003ek\u003c/i\u003e (2 ≤ \u003ci\u003en\u003c/i\u003e ≤ 50000;\r\n1 ≤ \u003ci\u003ek\u003c/i\u003e ≤ 50000), which are the number of crossroads and the number of road segments in Saint Petersburg,\r\nrespectively. Crossroads are numbered with integers from 1 to \u003ci\u003en\u003c/i\u003e.\r\nEach of the following \u003ci\u003ek\u003c/i\u003e lines contains two different integers, which are the\r\nnumbers of crossroads, connected by a road segment. All road segments are bidirectional.\r\nThere is at most one road segment between any\r\ntwo crossroads. The next line contains the number of test cases \u003ci\u003eq\u003c/i\u003e\r\n(1 ≤ \u003ci\u003eq\u003c/i\u003e ≤ 50000). Each of the following \u003ci\u003eq\u003c/i\u003e lines contains\r\ntwo different integers, which are the numbers of crossroads, where the hotel and\r\nAnichkov palace are situated, respectively.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eFor each test case output “Yes” if there are three such paths that no two\r\nof them share a common road segment. Otherwise, output “No”.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e6 9\r\n1 2\r\n1 5\r\n1 4\r\n1 6\r\n2 3\r\n3 4\r\n3 5\r\n4 5\r\n4 6\r\n9\r\n1 2\r\n1 3\r\n1 5\r\n2 4\r\n5 6\r\n3 6\r\n3 4\r\n2 6\r\n2 3\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eNo\r\nYes\r\nYes\r\nNo\r\nNo\r\nNo\r\nYes\r\nNo\r\nNo\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}