{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv\u003e\n 康康给康嫂写了几篇情书,想让你找出几个最好的,它们都已经被评过分了。\n\u003c/div\u003e \n\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003e给你N\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e,M, \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003eK,M封情书\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e, \n \u003cspan\u003eN\u003cspan\u003e\u003cspan\u003e\u003cspan\u003e个人已经评过分了\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e, \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003e要选出评分最高的K封\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e\n The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003eXKA\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e will put into his design. Then N lines follow, each contains M numbers. The \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003ej-th\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e number in the \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003ei-th\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e line represents the \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003ei-th\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e person\u0027s satisfaction on the \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003ej-th\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e element.\n\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e\n For each test case, print in one line the indices of the K elements you would suggest \n \u003cspan\u003e\u003cspan\u003e\u003cspan\u003e\u003cspan\u003eXKA\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e\u003c/span\u003e to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line.\n\u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cpre\u003e\r\n\t\u003c/pre\u003e \n \u003cdiv\u003e \n \u003cpre\u003e\r\n\t\t3 6 4\r\n2 2.5 5 1 3 4\r\n5 1 3.5 2 2 2\r\n1 1 1 1 1 10\r\n3 3 2\r\n1 2 3\r\n2 3 1\r\n3 1 2 \u003c/pre\u003e \n \u003c/div\u003e \n \u003cdiv\u003e\n \u0026nbsp;\n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cpre\u003e\r\n\t\u003c/pre\u003e \n \u003cdiv\u003e \n \u003cpre\u003e\r\n\t\t6 5 3 1\r\n2 1 \u003c/pre\u003e \n \u003c/div\u003e \n \u003cdiv\u003e\n \u0026nbsp;\n \u003c/div\u003e \n\u003c/div\u003e"}}]}