Memory Manager

There is little time left before the release of the first national operating system BerlOS. Some of its components are not finished yet — the memory manager is among them. According to the developers' plan, in the first release the memory manager will be very simple and rectilinear. It will support three operations:

• alloc n — to allocate n bytes of the memory and return the allocated block's identifier x;
• alloc pos n — to allocate n bytes of the memory from specified memory location pos  and return the allocated block's identifier x;
• erase x — to erase the block with the identifier x;
• defragment — to defragment the free memory, bringing all the blocks as close to the beginning of the memory as possible and preserving their respective order;

The memory model in this case is very simple. It is a sequence of m bytes, numbered for convenience from the first to them-th.

The first operation alloc n takes as the only parameter the size of the memory block that is to be allocated. While processing this operation, a free block of n successive bytes is being allocated in the memory. If the amount of such blocks is more than one, the block closest to the beginning of the memory (i.e. to the first byte) is prefered. All these bytes are marked as not free, and the memory manager returns a 32-bit integer numerical token that is the identifier of this block. If it is impossible to allocate a free block of this size, the function returns NULL.

The second operation erase x takes as its parameter the identifier of some block. This operation frees the system memory, marking the bytes of this block as free for further use. In the case when this identifier does not point to the previously allocated block, which has not been erased yet, the function returns ILLEGAL_ERASE_ARGUMENT.

The last operation defragment does not have any arguments and simply brings the occupied memory sections closer to the beginning of the memory without changing their respective order.

In the current implementation you are to use successive integers, starting with 1, as identifiers. Each successful allocoperation procession should return following number. Unsuccessful alloc operations do not affect numeration.

You are to write the implementation of the memory manager. You should output the returned value for each alloccommand. You should also output ILLEGAL_ERASE_ARGUMENT for all the failed erase commands.

Input

The first line of the input data contains two positive integers t and m (1 ≤ t ≤ 100;1 ≤ m ≤ 10000), where t — the amount of operations given to the memory manager for processing, and m — the available memory size in bytes. Then there follow tlines where the operations themselves are given. The first operation is alloc n (1 ≤ n ≤ 10000), where n is an integer. The second one is erase x, where x is an arbitrary 32-bit integer numerical token. The third operation is defragment.

Output

Output the sequence of lines. Each line should contain either the result of alloc operation procession , orILLEGAL_ERASE_ARGUMENT as a result of failed erase operation procession. Output lines should go in the same order in which the operations are processed. Successful procession of alloc operation should return integers, starting with 1, as the identifiers of the allocated blocks.

Sample test(s)

input

6 10
alloc 5
alloc 3
erase 1
alloc 6
defragment
alloc 6

output

1
2
NULL
3

代码：

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int x=input.nextInt();
        int y=input.nextInt();
        String[][] table=new String[x][y];
        String[] xian=new String[200];
        String residen=input.nextLine();
        String resident=residen.substring(1);
       for(int i=0;i<x;i++){//输入矩阵
           String s=input.nextLine();
           for(int j=0;j<y;j++){
               table[i][j]=s.substring(j,j+1);
           }
       }
       //寻找相邻桌子
        int num=0;
        for(int i=0;i<x;i++){
            for(int j=0;j<y;j++){
                if(table[i][j].equals(resident)) {
                    if(j-1>=0&&!(table[i][j-1].equals("."))&&!(table[i][j-1].equals(resident))) {
                        if(check(table[i][j-1],xian)){
                            xian[num] = table[i][j - 1];
                            num++;
                        }
                    }
                    if(j+1<y&&!(table[i][j+1].equals("."))&&!(table[i][j+1].equals(resident))){
                        if(check(table[i][j+1],xian)){
                            xian[num] = table[i][j + 1];
                            num++;
                        }
                    }

                    if(i-1>=0&&!(table[i-1][j].equals("."))&&!(table[i-1][j].equals(resident))){
                        if(check(table[i-1][j],xian)){
                            xian[num] = table[i-1][j];
                            num++;
                        }
                    }

                    if(i+1<x&&!(table[i+1][j].equals("."))&&!(table[i+1][j].equals(resident))){
                        if(check(table[i+1][j],xian)){
                            xian[num] = table[i+1][j];
                            num++;
                        }
                    }
                }
            }
        }
        System.out.println(num);
    }

    private static boolean check(String s1, String[] xian1) {
        for(int i=0;i<xian1.length;i++){
            if(s1.equals(xian1[i]))
                return false;
        }
        return true;
    }
}