Given ~n~ integers, find the sum of at most ~k~ largest distinct values.

Input

• The first line contains two integers ~n~, ~k~ (~1~ ≤ ~n~, ~k~ ≤ ~10^{5}~).

• The second line contains ~n~ integers (~-10^{9}~ ≤ ~ai~ ≤ ~10^{9}~).

Output

• The required sum.

Sample Input

10 3

9 5 21 15 16 1  5 1 9 21

Sample Output

52

Sample Input

10 8

9 5 21 15 16 1  5 1 9 21

Sample Output

67