Saving Princess Peach

Mario is trying to save his beloved Princess Peach. To do that, he must jump over many obstacles. So he makes a grand plan to infiltrate Bowser's castle.

First, he needs to practice. His brother Luigi builds a practice course for him. On this course, Mario looks for every obstacle that could take his life. But Mario is sloppy. He misses some obstacles, counts some of them more than once, and lists the ones he finds in a jumbled order.

Write a program that tells Luigi which obstacles Mario missed.

The first line contains two integers $N$ ($0 < N \le 100$) and $Y$ ($0 \le Y \le 200$). $N$ is the total number of obstacles, numbered $0 \ldots N-1$. $Y$ is the number of obstacles Mario says he found.

Each of the next $Y$ lines contains one integer $k$ ($0 \le k < N$), the number of an obstacle Mario says he found.

Print the obstacles Mario missed in increasing order, one per line. On the last line, print Mario got X of the dangerous obstacles. where $X$ is the number of distinct obstacles Mario found.