Problem Statement

Snuke has $N$ sticks. The length of the $i$-th stick is $l_i$.

Snuke is making a snake toy by joining $K$ of the sticks together.

The length of the toy is represented by the sum of the individual sticks that compose it. Find the maximum possible length of the toy.

Constraints

• $1 \leq K \leq N \leq 50$
• $1 \leq l_i \leq 50$
• $l_i$ is an integer.

Input

Input is given from Standard Input in the following format:

N K
l_1 l_2 l_3 ... l_{N}

Output

Print the answer.