A perimeter security fence carries a line of solar beacons wired in a single forward-only daisy chain: each beacon knows only the reading of the next beacon down the line, never the one before it. A maintenance drone docks directly onto exactly one beacon at a time and is told which position in the line that is; it is guaranteed the drone never docks on the final beacon in the chain. Because the drone cannot reach backwards, it repairs the chain using only forward information: it overwrites its docked beacon's stored reading with the next beacon's reading, then relinks its beacon directly to the beacon after that one, skipping the beacon it just copied from and removing it from the chain entirely.

Given the full sequence of beacon readings and the 0-indexed position where the drone docks, report the sequence of beacon readings that remains once the splice completes.

Input format

Line 1: an integer n, the number of beacons. Line 2: n space-separated integers, the beacon readings in chain order. Line 3: an integer p, the 0-indexed position where the drone docks.

Output format

Print the n - 1 remaining beacon readings, in chain order, space-separated on a single line.

Constraints

• 2 <= n <= 10^5
• -10^9 <= reading <= 10^9 for every beacon reading (readings need not be distinct)
• 0 <= p <= n - 2 (the drone never docks on the last beacon)

5
4 9 1 7 2
2

4 9 7 2

2
10 -5
0

-5