Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Parking Lot

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA parking lot in the City consists of *n* parking spaces, standing in a line. The parking spaces are numbered from 1 to *n* from left to right.

When a car arrives at the lot, the operator determines an empty parking space for it. For the safety's sake the chosen place should be located as far from the already occupied places as possible. That is, the closest occupied parking space must be as far away as possible. If there are several such places, then the operator chooses the place with the minimum index from them. If all parking lot places are empty, then the car gets place number 1.

We consider the distance between the *i*-th and the *j*-th parking spaces equal to 4·|*i* - *j*| meters.

You are given the parking lot records of arriving and departing cars in the chronological order. For each record of an arriving car print the number of the parking lot that was given to this car.

Input

The first line contains two space-separated integers *n* and *m* (1 ≤ *n*, *m* ≤ 2·10^{5}) — the number of parking places and the number of records correspondingly.

Next *m* lines contain the descriptions of the records, one per line. The *i*-th line contains numbers *t*_{i}, *id*_{i} (1 ≤ *t*_{i} ≤ 2; 1 ≤ *id*_{i} ≤ 10^{6}). If *t*_{i} equals 1, then the corresponding record says that the car number *id*_{i} arrived at the parking lot. If *t*_{i} equals 2, then the corresponding record says that the car number *id*_{i} departed from the parking lot.

Records about arriving to the parking lot and departing from the parking lot are given chronologically. All events occurred consecutively, no two events occurred simultaneously.

It is guaranteed that all entries are correct:

- each car arrived at the parking lot at most once and departed from the parking lot at most once,
- there is no record of a departing car if it didn't arrive at the parking lot earlier,
- there are no more than
*n*cars on the parking lot at any moment.

You can consider the cars arbitrarily numbered from 1 to 10^{6}, all numbers are distinct. Initially all places in the parking lot are empty.

Output

For each entry of an arriving car print the number of its parking space. Print the numbers of the spaces in the order, in which the cars arrive to the parking lot.

Examples

Input

7 11

1 15

1 123123

1 3

1 5

2 123123

2 15

1 21

2 3

1 6

1 7

1 8

Output

1

7

4

2

7

4

1

3

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/15/2017 15:03:02 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|