Xóa tất cả phần tử bằng x (Remove All Occurrences of x)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_0,a_1,\ldots,a_{n-1}$ and an integer $x$.

Remove all elements equal to $x$ while preserving the relative order of every remaining element.

Define

$$I=\{i\mid 0\le i<n,\ a_i\ne x\}.$$

Suppose

$$I=\{i_0,i_1,\ldots,i_{m-1}\},\qquad i_0<i_1<\cdots<i_{m-1}.$$

The result $b$ has length $m=|I|$ and

$$b_j=a_{i_j},\qquad 0\le j<m.$$

Print the logical size $m$ and the array $b$.

Input

The first line contains integers $n$ and $x$. The second line contains exactly $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print $m$ on the first line. If $m>0$, print $b_0,b_1,\ldots,b_{m-1}$ on the second line.

Subtask

Subtask 1 (100 points): $1\le n\le2\cdot10^5$; $|x|\le10^9$; $|a_i|\le10^9$.

Example

Input

8 3
3 1 3 2 3 4 3 5

Output

4
1 2 4 5

Explanation

The indices whose values are not $3$ are $1,3,5,7$, so the result in the original relative order is $[1,2,4,5]$ with size $4$.