Array Mastery II - Source & Semantics Clinic

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given $A=(a_0,\ldots,a_{n-1})$ and $x,y$, perform a final chapter clinic: report inferred size and last valid index; copy $A$ independently; report UNKNOWN for attempting to recover original length from a function parameter int a[] via sizeof; find first/last index and frequency of $x$; reverse-copy the array; replace all $x$ by $y$ and count activated replacements; finally compute the minimum number of +1 moves needed to make the replaced array nondecreasing.

Input

Read $n$, the array, then $x,y$.

Output

Print the 9 lines specified by the Vietnamese statement: size/last index, copy, UNKNOWN, first/last, frequency, reverse, replacement count, replaced array, and minimum repair moves.

Subtask

Subtask 1 (20 points): $1\le n\le10$, magnitudes at most 100.

Subtask 2 (30 points): $1\le n\le1000$, magnitudes at most $10^6$.

Subtask 3 (50 points): $1\le n\le10^5$, magnitudes at most $10^9$.

Example

Input

5
3 1 3 2 3
3 4

Output

5 4
3 1 3 2 3
UNKNOWN
0 4
3
3 2 3 1 3
3
4 1 4 2 4
5

Explanation

After replacing 3 by 4, the array is (4,1,4,2,4); 3+2=5 increments are necessary.