Swap Two Elements by Index

Source: Phuoc Hung OJ

Version: Phuoc Hung OJ Extended

Problem

Given $A=(a_0,\ldots,a_{n-1})$ and valid 0-based indices $i,j$, swap $a_i$ and $a_j$. If $i=j$, the array is unchanged. For the result $B$, $b_i=a_j$, $b_j=a_i$, and $b_k=a_k$ for every other index $k$.

Input

The first line contains $n$, the second line contains the array, and the last line contains $i,j$ with $0\le i,j<n$.

Output

Print the array after the swap.

Subtask

Subtask 1 (20 points): $1\le n\le10$.

Subtask 2 (30 points): $1\le n\le100$.

Subtask 3 (50 points): $1\le n\le1000$.

Example

Input

5
10 20 30 40 50
1 4

Output

10 50 30 40 20

Explanation

The values at indices 1 and 4 are exchanged.