21040_AppleTree

There are so many problems called "Apple Tree", includeing the one you are reading now. After 钟Sir goes back home, he finds that all his grandpa's apple trees go ripe. He is so happy and wants to pick some apples back to his school and shares them with all his students. Assume all the trees are in a line. To stop 钟Sir from picking all the apples, his grandpa asks him to pick from k trees. So 钟Sir asks you, a genius programer, to help him find out how many apples could he pick at most.

There are mutiple test cases.

In the first line of each test case there is only one interger N, indicating the number of grandpa's apple trees. Here 0 < N ≤ 1000.  line with N = 0 indicating the end of the input file.

In the second line of each test case there is only one positive integer K, which is described above.

In the next N lines there is one integer A_i per line, which is the number of apples in the i-th tree. Here 0 < A_i ≤ 100.

For each case, output one line with only one number which is the maximum apples 钟Sir can pick.

5
2
1
2
3
4
5
3
3
10
10
10
0

9
30