CF46D.Parking Lot

Nowadays it is becoming increasingly difficult to park a car in cities successfully. Let's imagine a segment of a street as long as L meters along which a parking lot is located. Drivers should park their cars strictly parallel to the pavement on the right side of the street (remember that in the country the authors of the tasks come from the driving is right side!). Every driver when parking wants to leave for themselves some extra space to move their car freely, that's why a driver is looking for a place where the distance between his car and the one behind his will be no less than b meters and the distance between his car and the one in front of his will be no less than f meters (if there's no car behind then the car can be parked at the parking lot segment edge; the same is true for the case when there're no cars parked in front of the car). Let's introduce an axis of coordinates along the pavement. Let the parking lot begin at point 0 and end at point L. The drivers drive in the direction of the coordinates' increasing and look for the earliest place (with the smallest possible coordinate) where they can park the car. In case there's no such place, the driver drives on searching for his perfect peaceful haven. Sometimes some cars leave the street and free some space for parking. Considering that there never are two moving cars on a street at a time write a program that can use the data on the drivers, entering the street hoping to park there and the drivers leaving it, to model the process and determine a parking lot space for each car.

如今，在城市中成功停车正变得越来越困难。我们设想一段长度为 $L$ 米的街道，其右侧（注意：本题作者所在国家靠右行驶！）设有一处停车场。驾驶员必须严格沿路沿平行停放车辆。每位驾驶员在停车时，都希望为自己预留额外空间以便自由移动车辆，因此他将寻找一个位置，使得其车辆与后方车辆之间的距离不小于 $b$ 米，且与其前方车辆之间的距离不小于 $f$ 米（若其后方无车，则可停靠于停车场起始端点；同理，若其前方无车，则可停靠于停车场末端点）。我们沿路沿建立一维坐标系：停车场起始于坐标 $0$，终止于坐标 $L$。驾驶员沿坐标轴正方向驶入，并寻找首个（即坐标值最小的）可停放车辆的位置。若不存在这样的位置，该驾驶员将继续前行，寻找他理想中的宁静港湾。有时，部分车辆会驶离街道，从而腾出停车位。假设街道上任意时刻至多只有一辆正在移动的车辆，请编写一个程序，根据驶入街道期望停车的驾驶员信息以及驶离街道的驾驶员信息，模拟整个过程，并为每辆车确定其停放位置。

The first line contains three integers L, b и f (10 ≤ L ≤ 100000, 1 ≤ b, f ≤ 100). The second line contains an integer n (1 ≤ n ≤ 100) that indicates the number of requests the program has got. Every request is described on a single line and is given by two numbers. The first number represents the request type. If the request type is equal to 1, then in that case the second number indicates the length of a car (in meters) that enters the street looking for a place to park. And if the request type is equal to 2, then the second number identifies the number of such a request (starting with 1) that the car whose arrival to the parking lot was described by a request with this number, leaves the parking lot. It is guaranteed that that car was parked at the moment the request of the 2 type was made. The lengths of cars are integers from 1 to 1000.

第一行包含三个整数 $L$、$b$ 和 $f$（$10 \leq L \leq 100000$，$1 \leq b, f \leq 100$）。
第二行包含一个整数 $n$（$1 \leq n \leq 100$），表示程序接收到的请求总数。
每个请求占一行，由两个数字描述：第一个数字表示请求类型。

• 若请求类型为 1，则第二个数字表示一辆驶入街道寻找停车位的汽车的长度（单位：米）；
• 若请求类型为 2，则第二个数字表示某个先前请求的编号（从 1 开始计数），即该编号对应的请求所描述的汽车此时驶离停车场。
  保证在发出类型为 2 的请求时，对应编号的汽车确实在停车场内停放。
  汽车长度均为 $1$ 至 $1000$ 之间的整数。

For every request of the 1 type print number -1 on the single line if the corresponding car couldn't find place to park along the street. Otherwise, print a single number equal to the distance between the back of the car in its parked position and the beginning of the parking lot zone.

对于每个类型为 1 的请求，若对应车辆无法在街道上找到停车位，则在单独一行输出数字 $-1$；否则，输出一个数字，该数字等于车辆停稳后其尾部到停车场区域起点的距离。