output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      l_1 l_2 l_3 ... l_{N}
attempt: import sys, re
  from math import ceil, floor, sqrt, pi, factorial, gcd
  from copy import deepcopy
  from collections import Counter, deque
  from heapq import heapify, heappop, heappush
  from itertools import accumulate, product, combinations, combinations_with_replacement
  from bisect import bisect, bisect_left, bisect_right
  from functools import reduce
  from decimal import Decimal, getcontext
  
  
  # input = sys.stdin.readline
  def i_input():
      return int(input())
  
  
  def i_map():
      return map(int, input().split())
  
  
  def i_list():
      return list(i_map())
  
  
  def i_row(N):
      return [i_input() for _ in range(N)]
  
  
  def i_row_list(N):
      return [i_list() for _ in range(N)]
  
  
  def s_input():
      return input()
  
  
  def s_map():
      return input().split()
  
  
  def s_list():
      return list(s_map())
  
  
  def s_row(N):
      return [s_input for _ in range(N)]
  
  
  def s_row_str(N):
      return [s_list() for _ in range(N)]
  
  
  def s_row_list(N):
      return [list(s_input()) for _ in range(N)]
  
  
  def lcm(a, b):
      return a * b // gcd(a, b)
  
  
  sys.setrecursionlimit(10**6)
  INF = float("inf")
  MOD = 10**9 + 7
  num_list = []
  str_list = []
  
  
  def main():
      n, k = i_map()
      num_list = i_list()
  
      num_list.sort(reverse=True)
  
      print(num_list[:2])
  
  
  if __name__ == "__main__":
      main()
  
problem_description: 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.
samples: [{"input": "5 3\n    1 2 3 4 5", "output": "12\n    \n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5,\nwhich is the maximum possible length.\n\n* * *"}, {"input": "15 14\n    50 26 27 21 41 7 42 35 7 5 5 36 39 1 45", "output": "386"}]