Find the k-th Word

Problem Description

Given a sequence of $n$ words, output the $k$-th word in the sequence.

Input Format

The first line contains two positive integers $n, k$ ($0 < k \le n \le 1000$).

The second line contains $n$ words in succession, each consisting only of lowercase English letters and of length at most $30$.

Output Format

Output the $k$-th word.

Sample Input

5 2
one two three four five

Sample Output

two

Hint

• You only need to obtain the $k$-th word and then your program may stop; you do not have to read in all the words.