{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOnce upon a time there was a king. One day the king counted up the collected taxes and decided to\r\nspend the money for the road maintenance. There were \u003ci\u003eN\u003c/i\u003e cities in that kingdom and \u003ci\u003eM\u003c/i\u003e two-way roads connected them in such way that one could travel from a city to others using these roads. The road network was catastrophic without repairing, so the king made up his mind to repair as many roads as possible during the summer, before the money depreciated. The inhabitants of the kingdom were shocked to know that all the ways they used to go would be blocked for summer. So the king promised that at most one road from a city would be blocked. Help the king to fulfil his plan without displeasing the citizens. \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 of input contains two natural numbers \u003ci\u003eN\u003c/i\u003e and \u003ci\u003eM\u003c/i\u003e (2 ≤ \u003ci\u003eN\u003c/i\u003e ≤ 10\u003csup\u003e5\u003c/sup\u003e, \u003ci\u003eM\u003c/i\u003e \u003d \u003ci\u003eN\u003c/i\u003e\u0026nbsp;−\u0026nbsp;1), separated with a space. Each of the next \u003ci\u003eM\u003c/i\u003e lines describes a road in the form (\u003ci\u003ea\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003eb\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e), where \u003ci\u003ea\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e and \u003ci\u003eb\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e are numbers of the cities connected with \u003ci\u003ei\u003c/i\u003e\u0027th road (1 ≤ \u003ci\u003ea\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003eb\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e ≤ \u003ci\u003eN\u003c/i\u003e).\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line of output should contain the only integer \u003ci\u003eK\u003c/i\u003e being the maximum number of roads that the king can close for maintenance without raising disorders in his kingdom.\r\nThe next \u003ci\u003eK\u003c/i\u003e lines should describe these roads in the same form as they were given in the input.\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\u003e4 3\r\n1 2\r\n2 3\r\n3 4\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n1 2\r\n3 4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}