Distance Between Two Indexed Elements

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

You are given an integer array $a$ of length $n$, indexed from $0$ to $n-1$, and two distinct valid indices $i,j$. In this PHOJ specification, the distance between the two indexed elements is defined as the absolute difference of their values:

Compute $D$.

Input

• The first line contains three integers $n$, $i$, and $j$. Indices $i,j$ are 0-based.
• The second line contains exactly $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print one integer $D=|a_i-a_j|$.

Subtasks

Subtask 1 (20 points): $2 \le n \le 10$, $i=0$, $j=n-1$, $-9 \le a_t \le 9$.

Subtask 2 (30 points): $2 \le n \le 20$, $0 \le i<j<n$, $0 \le a_t \le 10^4$.

Subtask 3 (50 points): $2 \le n \le 1000$, $0 \le i,j<n$, $i\ne j$, $-10^9 \le a_t \le 10^9$.

Examples

Input

5 1 4
8 6 7 5 -3

Output

9

Explanation

The indices are $i=1$ and $j=4$. We have $a_1=6$ and $a_4=-3$. Thus

The output is 9.