A. 练60.1 丢失的数字

    Type: Default 1000ms 64MiB

练60.1 丢失的数字

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Given mm integers between 11 and nn, can you find which integers from 11 to nn are missing?

Input Format

The first line contains two integers nn and mm separated by a space (1n1000001 \le n \le 100000, m<nm < n), indicating there are mm integers between 11 and nn. The next mm lines each contain one integer aia_i (1ain1 \le a_i \le n, it is guaranteed that all mm numbers are different).

Output Format

Output one number per line, in ascending order, the integers from 11 to nn that do not appear in the input data.

Sample

5 3
3
1
4
2
5

20251101C班作业(5)

Not Claimed
Status
Done
Problem
6
Open Since
2025-11-1 0:00
Deadline
2025-11-9 23:59
Extension
24 hour(s)