Xóa phần tử tại vị trí p (Delete the Element at Position p)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array of logical size $n\ge1$:

$$a_0,a_1,\ldots,a_{n-1}.$$

Given an index $p$ satisfying

$$0\le p<n.$$

Delete $a_p$. The new size is $n'=n-1$. For every $0\le i<n'$:

$$b_i= \begin{cases} a_i, & i<p,\\ a_{i+1}, & i\ge p. \end{cases}$$

Print the new size and the remaining array.

Input

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

Output

Print $n-1$ on the first line. If $n-1>0$, print the remaining elements on the second line.

Subtask

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

Example

Input

5 2
10 20 30 40 50

Output

4
10 20 40 50

Explanation

The element $a_2=30$ is deleted; 40 and 50 shift one position to the left.