{"trustable":true,"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 class\u003d\"panel_content\"\u003eNow I think you have got an AC in Ignatius.L\u0027s \"Max Sum\" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.\u003cbr\u003e\u003cbr\u003eGiven a consecutive number sequence S\u003csub\u003e\u003ci\u003e1\u003c/i\u003e\u003c/sub\u003e, S\u003csub\u003e\u003ci\u003e2\u003c/i\u003e\u003c/sub\u003e, S\u003csub\u003e\u003ci\u003e3\u003c/i\u003e\u003c/sub\u003e, S\u003csub\u003e\u003ci\u003e4\u003c/i\u003e\u003c/sub\u003e ... S\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e, ... S\u003csub\u003e\u003ci\u003en\u003c/i\u003e\u003c/sub\u003e (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ S\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e ≤ 32767). We define a function sum(i, j) \u003d S\u003csub\u003e\u003ci\u003ei\u003c/i\u003e\u003c/sub\u003e + ... + S\u003csub\u003e\u003ci\u003ej\u003c/i\u003e\u003c/sub\u003e (1 ≤ i ≤ j ≤ n).\u003cbr\u003e\u003cbr\u003eNow given an integer m (m \u0026gt; 0), your task is to find m pairs of i and j which make sum(i\u003csub\u003e\u003ci\u003e1\u003c/i\u003e\u003c/sub\u003e, j\u003csub\u003e\u003ci\u003e1\u003c/i\u003e\u003c/sub\u003e) + sum(i\u003csub\u003e\u003ci\u003e2\u003c/i\u003e\u003c/sub\u003e, j\u003csub\u003e\u003ci\u003e2\u003c/i\u003e\u003c/sub\u003e) + sum(i\u003csub\u003e\u003ci\u003e3\u003c/i\u003e\u003c/sub\u003e, j\u003csub\u003e\u003ci\u003e3\u003c/i\u003e\u003c/sub\u003e) + ... + sum(i\u003csub\u003e\u003ci\u003em\u003c/i\u003e\u003c/sub\u003e, j\u003csub\u003e\u003ci\u003em\u003c/i\u003e\u003c/sub\u003e) maximal (i\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e ≤ i\u003csub\u003e\u003ci\u003ey\u003c/i\u003e\u003c/sub\u003e ≤ j\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e or i\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e ≤ j\u003csub\u003e\u003ci\u003ey\u003c/i\u003e\u003c/sub\u003e ≤ j\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e is not allowed).\u003cbr\u003e\u003cbr\u003eBut I`m lazy, I don\u0027t want to write a special-judge module, so you don\u0027t have to output m pairs of i and j, just output the maximal summation of sum(i\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e, j\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e)(1 ≤ x ≤ m) instead. ^_^\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"Each test case will begin with two integers m and n, followed by n integers S\u003csub\u003e\u003ci\u003e1\u003c/i\u003e\u003c/sub\u003e, S\u003csub\u003e\u003ci\u003e2\u003c/i\u003e\u003c/sub\u003e, S\u003csub\u003e\u003ci\u003e3\u003c/i\u003e\u003c/sub\u003e ... S\u003csub\u003e\u003ci\u003en\u003c/i\u003e\u003c/sub\u003e.\u003cbr\u003eProcess to the end of file.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"Output the maximal summation described above in one line.\u003cbr\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\u003e1 3 1 2 3\r\n2 6 -1 4 -2 3 -2 3\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\r\n8\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cbr\u003eHuge input, scanf and dynamic programming is recommended.\u003cbr\u003e"}}]}