Invitation List Manager

You are given an integer n and a sequence of update operations. Each operation is of the form add x or remove x, where x is an employee ID such that \(1 \le x \le n\). Initially, the invitation list is empty and you need to process the operations in the given order. After processing all operations, output the sorted list of employee IDs that remain in the invitation list.

Note: If an employee is added multiple times, it should be stored only once. A removal of a non-existing employee should be ignored.

inputFormat

The first line contains a single integer n, the maximum employee ID.

The second line contains a single integer m, the number of operations.

The next m lines each contain an operation formatted as a string and an integer separated by a space. The string is either add or remove, indicating the type of update, and the integer is the employee ID.

outputFormat

Output a single line containing the employee IDs that remain in the invitation list, sorted in ascending order and separated by a single space. If the invitation list is empty, output an empty line.

## sample

5
1
add 1

1

</p>