Remove Elements Outside [L, R]

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given $a_0,a_1,\ldots,a_{n-1}$ and integers $L\le R$, keep exactly the elements satisfying

remove all others, and preserve the relative order of the kept elements. If $J=\{j_0<\cdots<j_{m-1}\}$ is the set of kept indices, then $b_k=a_{j_k}$.

Input

The first line contains $n$, $L$, and $R$. The second line contains $n$ integers $a_i$.

Output

Print $m$, then the filtered array on the second line; if $m=0$, the second line is empty.

Subtask

Subtask 1 (20 points): $1\le n\le10$, $|a_i|,|L|,|R|\le10^3$, $L\le R$.

Subtask 2 (30 points): $1\le n\le5000$, $|a_i|,|L|,|R|\le10^6$, $L\le R$.

Subtask 3 (50 points): $1\le n\le2\cdot10^5$, $|a_i|,|L|,|R|\le10^9$, $L\le R$.

Example

Input

7 -2 5
-7 -2 0 8 5 6 1

Output

4
-2 0 5 1

Explanation

The output follows directly from the mathematical definition above.