{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIn some computer company, Mouse Inc., there is very complicated network structure.\r\nThere are a lot of branches in different countries, so the only way to communicate\r\nwith each other is the Internet. And it\u0027s worth to say that interaction is the key\r\nto the popularity and success of the Mouse Inc.\r\n\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe CEO of this company is interested now to figure out whether there is a way to\r\nattack and devastate whole structure. Only two hackers are capable to perpetrate\r\nsuch an outrage\u0026nbsp;— Vasya and Petya, who can destroy any two channels. \r\nIf after that there are at least two servers without connection between them, then \r\nthey succeed.\r\n\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIn other words, the company is a set of servers, some of them connected with\r\nbidirectional channels. It\u0027s guaranteed that all the servers are connected directly or\r\nindirectly. The hackers\u0027 goal is to divide network into at least two parts without any\r\nconnection between them. Each hacker can destroy exactly one channel. And they can\u0027t\r\ndestroy the same channel together. You are asked to count the number of ways for hackers to win.\r\n\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThere are two integer numbers (\u003ci\u003eN\u003c/i\u003e, \u003ci\u003eM\u003c/i\u003e) in the first line of input: the number\r\nof servers and channels respectively (1\u0026nbsp;≤\u0026nbsp;\u003ci\u003eN\u003c/i\u003e\u0026nbsp;≤\u0026nbsp;2000;\r\n 0\u0026nbsp;≤\u0026nbsp;\u003ci\u003eM\u003c/i\u003e\u0026nbsp;≤\u0026nbsp;100000). In the each of the next \u003ci\u003eM\u003c/i\u003e lines \r\nthere are exactly two numbers\u0026nbsp;— the indices of servers connected by channel. Channels \r\ncan connect a server to itself. There can be multiple channels between one pair of servers. \r\nThe servers are numbered from 1 to \u003ci\u003eN\u003c/i\u003e.\r\n\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThere must be exactly one integer\u0026nbsp;— the answer to the question described in the problem.\r\n\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\u003e3 3\r\n1 2\r\n2 3\r\n3 1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}