Description
Domo is facing his midterm 2 and wants to get a good grade. Otherwise, he will be punished and his dinner will be reduced.
He wants to have a perfect dinner after this midterm. Can you help him?
There're N problems in this midterm, and each problem has different point. Since Domo does not have enough time to finish all of them, he can only finish K problems among them.
What is the maximum point Domo can get?
Input
The first line contains two integers N and K (1 ≤ N ≤ 10000, 1 ≤ K ≤ N)
The second line contains N integers (a1 ... an), describing the point you'll get when you solve each problem. (1 ≤ ai ≤ 106)
Output
Output the maximum score you can get, and print a newline character at the end of the line.