After landing a job in a math empire, Mr. White's first task is to grade Massey students' Putnam contests. In total, there are ~N~ ~(1 \le N \le 100\,000)~ contests that require marking, each with a certain score associated with them. Since the contest is so difficult, it is possible for students to get negative marks.
Furthermore, Mr. White can only send in up to ~K~ ~(1 \le K \le N)~ of the contests. Help Mr. White find the maximum sum of scores that he can send in.
The first line contains two space-separated integers ~N~ and ~K~. This is followed by ~N~ lines, each containing a single integer, describing the contest scores.
Print a single integer, the maximum sum of up to ~K~ contest scores. The answer will be guaranteed to fit inside of a 32-bit signed integer.
5 2 5 2 7 5 3