802_M. April Fools' Problem (easy)
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 a1, a2, ..., an. 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 a1, ..., an (1 ≤ ai ≤ 104).

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
```python
n,k=map(int,input().split());print(sum(sorted(list(map(int,input().split())))[:k]))
```