Vasya has found a piece of paper with a coordinate system written on it. There are *n* distinct squares drawn in this coordinate system. Let's number the squares with integers from 1 to *n*. It turned out that points with coordinates (0, 0) and (*a*<sub class="lower-index">*i*</sub>, *a*<sub class="lower-index">*i*</sub>) are the opposite corners of the *i*-th square.

Vasya wants to find such integer point (with integer coordinates) of the plane, that belongs to exactly *k* drawn squares. We'll say that a point belongs to a square, if the point is located either inside the square, or on its boundary. 

Help Vasya find a point that would meet the described limits.
The first line contains two space-separated integers *n*, *k* (1 ≤ *n*, *k* ≤ 50). The second line contains space-separated integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).

It is guaranteed that all given squares are distinct.
n,k=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
print( str(l[n-k])+" "+str(l[n-k])