A relay chain of n nodes is given head to tail. Remove the node that is k-th from the end (the last node is 1st from the end, the second-to-last is 2nd from the end, and so on), then print the resulting chain.
Input format
Line 1: an integer n, the number of nodes (n >= 1).
Line 2: n space-separated integers, the node values from head to tail.
Line 3: an integer k, with 1 <= k <= n.
Output format
Line 1: the number of nodes remaining, n - 1.
Line 2: the remaining values from head to tail, space-separated (empty line if none remain).
Constraints
- 1 <= n <= 100000
- 1 <= k <= n
- -1000000000 <= each value <= 1000000000