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.*;
import java.util.Arrays;

class Main{
	public static void main(String args[]){
		Scanner stdIn = new Scanner(System.in);
		
		int n = stdIn.nextInt(),k = stdIn.nextInt();
		int l[] = new int[n];
		for (int count = 0; count < n; count++){
			l[count]=stdIn.nextInt();
		}
		Arrays.sort(l); 
		int sum = 0;
		for (int count2 = 1; count2 < k+1;count2++){
			sum=sum+l[n-count2];
		}
		System.out.println(sum);
		

		
	}
}