Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

greedy

sortings

*1200

No tag edit access

The problem statement has recently been changed. View the changes.

×
M. April Fools' Problem (easy)

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe marmots have prepared a very easy problem for this year's HC^{2} – 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.

However 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!

Input

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} ≤ 10^{4}).

Output

Output one number.

Examples

Input

8 5

1 1 1 1 1 1 1 1

Output

5

Input

10 3

16 8 2 4 512 256 32 128 64 1

Output

7

Input

5 1

20 10 50 30 46

Output

10

Input

6 6

6 6 6 6 6 6

Output

36

Input

1 1

100

Output

100

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/04/2023 13:41:57 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|