|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||16||5||5||31.250%|
It's school time, and today the first graders are learning about positive integers. The teacher wrote numbers from $1$ to $n$ in ascending order on the blackboard, for demonstration.
Unfortunately, young hooligan Kolya from the 11-th grade ran into the classroom and ruined the beautiful sequence written on the blackboard. Standing before the principal he repented and claimed that he only erased one number from the sequence.
Help the teacher to figure out whether this can be true, and if it can, which number was erased by Kolya.
The first line of input contains one integer $n$ --- the number of integers written by the teacher on the blackboard ($2 \le n \le 1000$).
The second line of input contains the number $m$ --- the number of integers on the blackboard after Kolya's actions ($1 \le m \le 1000$).
The third line contains $m$ integers $a_1, a_2, \ldots, a_m$ --- the integers on the blackboard after Kolya's actions, in the order they are written on the board ($1 \le a_i \le 1000$).
If Kolya's explanations are plausible, and the numbers written on the blackboard could be obtained from the sequence $1, 2, \ldots, n$ by erasing exactly one number, output the word <<
Yes>> at the first line. The next line must contain the number that was erased by Kolya.
Otherwise output one word <<
4 3 1 3 4
4 3 3 3 3
4 2 1 2
4 4 1 2 3 4
4 3 4 3 1