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
import java.util.*;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int data[] = new int [n];
		int a,ans = 0;
		for(int i = 0;i < n;i++)data[i]=sc.nextInt();
		for(int i = 0;i < n;i++) {
			for(int j = i+1;j < n;j++) {
				if(data[i] >data[j]) {
					a = data[i];
					data[i] = data[j];
					data[j] = a;
				}
			}
		}
		
		for(int i = n-1;i > n-k-1;i--) {
			ans += data[i];
		}
		System.out.println(ans);
	}

}