{"raw_statement":[{"iden":"statement","content":"The marmots have prepared a very easy problem for this year's HC2 – this one. It involves numbers _n_, _k_ and a sequence of _n_ positive integers _a_1, _a_2, ..., _a__n_. They also came up with a beautiful and riveting story for the problem statement. It explains what the input means, what the program should output, and it also reads like a good criminal.\n\nHowever I, Heidi, will have none of that. As my joke for today, I am removing the story from the statement and replacing it with these two unhelpful paragraphs. Now solve the problem, fools!"},{"iden":"input","content":"The first line of the input contains two space-separated integers _n_ and _k_ (1 ≤ _k_ ≤ _n_ ≤ 2200). The second line contains _n_ space-separated integers _a_1, ..., _a__n_ (1 ≤ _a__i_ ≤ 104)."},{"iden":"output","content":"Output one number."},{"iden":"examples","content":"Input\n\n8 5\n1 1 1 1 1 1 1 1\n\nOutput\n\n5\n\nInput\n\n10 3\n16 8 2 4 512 256 32 128 64 1\n\nOutput\n\n7\n\nInput\n\n5 1\n20 10 50 30 46\n\nOutput\n\n10\n\nInput\n\n6 6\n6 6 6 6 6 6\n\nOutput\n\n36\n\nInput\n\n1 1\n100\n\nOutput\n\n100"}],"translated_statement":[{"iden":"statement","content":"土拨鼠为今年的 HC#cf_span[2] 准备了一个非常简单的题目——就是这个。它涉及数字 #cf_span[n]、#cf_span[k] 和一个由 #cf_span[n] 个正整数组成的序列 #cf_span[a1, a2, ..., an]。他们还为题面编写了一个优美而引人入胜的故事，解释了输入的含义、程序应输出什么，并且读起来像一部优秀的犯罪小说。\n\n然而，我，海蒂，对此不屑一顾。作为我今天的玩笑，我将故事从题面中移除，并用这两段无用的段落取而代之。现在，去解这个题吧，傻瓜们！\n\n输入的第一行包含两个用空格分隔的整数 #cf_span[n] 和 #cf_span[k]（#cf_span[1 ≤ k ≤ n ≤ 2200]）。第二行包含 #cf_span[n] 个用空格分隔的整数 #cf_span[a1, ..., an]（#cf_span[1 ≤ ai ≤ 104]）。\n\n请输出一个数。\n\n"},{"iden":"input","content":"输入的第一行包含两个用空格分隔的整数 #cf_span[n] 和 #cf_span[k]（#cf_span[1 ≤ k ≤ n ≤ 2200]）。第二行包含 #cf_span[n] 个用空格分隔的整数 #cf_span[a1, ..., an]（#cf_span[1 ≤ ai ≤ 104]）。"},{"iden":"output","content":"请输出一个数。"},{"iden":"examples","content":"输入\n8 5\n1 1 1 1 1 1 1 1\n输出\n5\n\n输入\n10 3\n16 8 2 4 512 256 32 128 64 1\n输出\n7\n\n输入\n5 1\n20 10 50 30 46\n输出\n10\n\n输入\n6 6\n6 6 6 6 6 6\n输出\n36\n\n输入\n1 1\n100\n输出\n100"}],"sample_group":[],"show_order":[],"formal_statement":"Given:  \n- Integers $ n, k $ such that $ 1 \\leq k \\leq n \\leq 2200 $.  \n- A sequence $ a = (a_1, a_2, \\dots, a_n) $ of positive integers with $ 1 \\leq a_i \\leq 10^4 $.  \n\nObjective:  \nOutput the maximum possible sum of $ k $ non-overlapping contiguous subarrays of $ a $.","simple_statement":null,"has_page_source":false}