Element at Position p

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

You are given an integer array $a$ of length $n$. Positions in the statement are numbered from $1$ to $n$: position $1$ stores $a_0$, position $2$ stores $a_1$, and in general position $p$ stores $a_{p-1}$. Print the value at the valid position $p$.

Input

• The first line contains two integers $n$ and $p$, where $p$ is 1-based.
• The second line contains exactly $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print one integer: $a_{p-1}$.

Subtasks

Subtask 1 (20 points): $1 \le n \le 10$, $p=1$, $-9 \le a_i \le 9$.

Subtask 2 (30 points): $2 \le n \le 20$, $p=n$, $0 \le a_i \le 10^4$.

Subtask 3 (50 points): $1 \le p \le n \le 1000$, $-10^9 \le a_i \le 10^9$.

Examples

Input

5 3
8 6 7 5 3

Output

7

Explanation

Position $p=3$ is 1-based, so the corresponding 0-based index is $p-1=2$. The sample has $a_2=7$, therefore the output is 7.