An array contains all integers from 1 to n except two of them, in some order. Recover the two missing numbers and output them in ascending order. n is the value such that the full set would be 1..n; the array therefore has n - 2 elements.
Input format
Line 1: two integers n and m, where m = n - 2 is the array length.
Line 2: the m present numbers (present whenever m >= 1).
Output format
One line: the two missing numbers, smaller first, separated by a space.
Constraints
- 2 <= n <= 100000
- The array contains distinct integers from 1..n, exactly two of which are absent.