{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cspan lang\u003d\"en-us\"\u003e\u003cp\u003eDemy has \u003ci\u003en\u003c/i\u003e jewels. Each of her jewels has some value \u003ci\u003ev\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e and weight \u003ci\u003ew\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e.\u003c/p\u003e\u003cp\u003eSince her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has decided that she would keep \u003ci\u003ek\u003c/i\u003e best jewels for herself. She decided to keep such jewels that their specific value is as large as possible. That is, denote the specific value of some set of jewels \u003ci\u003eS\u003c/i\u003e \u003d {\u003ci\u003ei\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e, \u003ci\u003ei\u003c/i\u003e\u003csub\u003e2\u003c/sub\u003e, …, \u003ci\u003ei\u003csub\u003ek\u003c/sub\u003e\u003c/i\u003e} as\u003c/p\u003e\u003cp align\u003d\"center\"\u003e\u003cimg src\u003d\"CDN_BASE_URL/0389497dbaae925e36b0db87a8ec2f48?v\u003d1714815765\" align\u003d\"absmiddle\"\u003e.\u003c/p\u003e\u003cp\u003eDemy would like to select such \u003ci\u003ek\u003c/i\u003e jewels that their specific value is maximal possible. Help her to do so.\u003c/p\u003e\u003c/span\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cspan lang\u003d\"en-us\"\u003e\u003cp\u003eThe first line of the input file contains \u003ci\u003en\u003c/i\u003e — the number of jewels Demy got, and \u003ci\u003ek\u003c/i\u003e — the number of jewels she would like to keep (1 ≤ \u003ci\u003ek\u003c/i\u003e ≤ \u003ci\u003en\u003c/i\u003e ≤ 100 000).\u003c/p\u003e\u003cp\u003eThe following \u003ci\u003en\u003c/i\u003e lines contain two integer numbers each — \u003ci\u003ev\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e and \u003ci\u003ew\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e (0 ≤ \u003ci\u003ev\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e ≤ 10\u003csup\u003e6\u003c/sup\u003e, 1 ≤ \u003ci\u003ew\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e ≤ 10\u003csup\u003e6\u003c/sup\u003e, both the sum of all \u003ci\u003ev\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e and the sum of all \u003ci\u003ew\u003csub\u003ei\u003c/sub\u003e\u003c/i\u003e do not exceed 10\u003csup\u003e7\u003c/sup\u003e).\u003c/p\u003e\u003c/span\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eOutput \u003ci\u003ek\u003c/i\u003e numbers — the numbers of jewels Demy must keep. If there are several solutions, output any one.\u003c/p\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 2\r\n1 1\r\n1 2\r\n1 3\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1 2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}