#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,a[55],sum=0;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=n;i>=n-k+1;i--)
    sum+=a[i];
    cout<<sum;
    return 0;
}
### Prompt

Create a solution in Cpp for the following problem:

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.

Examples

Input

5 3
1 2 3 4 5


Output

12


Input

15 14
50 26 27 21 41 7 42 35 7 5 5 36 39 1 45


Output

386

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,a[55],sum=0;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=n;i>=n-k+1;i--)
    sum+=a[i];
    cout<<sum;
    return 0;
}
```