#include<iostream>
#include<string>
using namespace std;
int k[105];
int main()
{
int n,m;
cin>>n>>m;
string a="alloc";
string b="erase";
string c="defragment";
for(int i=m;i<105;i++)
{
k[i]=9999999;
}
int cnt2=1;
for(int i=0;i<n;i++)
{
string d;
int temp;
cin>>d;
if(d!=c)
cin>>temp;
if(d==a)
{
//cout<<"XXXX"<<endl;
//cnt2++;
int cnt=0;
int mark=999999999;
for(int i=0;i<m;i++)
{
if(k[i]==0)
{
cnt++;
}
else
{
cnt=0;
}
if(cnt>=temp)
{
mark=i;
break;
}
}
if(mark!=999999999)
{
for(int i=0;i<temp;i++)
{
k[mark-i]=cnt2;
}
cout<<cnt2<<endl;
cnt2++;
}
else
{
cout<<"NULL"<<endl;
}
}
if(d==b)
{
int cnt=0;
int mark=999999988;
for(int i=0;i<m;i++)
{
if(k[i]==temp)
{
mark=i;
break;
}
}
if(mark!=999999988&&temp!=0)
{
for(int i=mark;k[i]==temp;i++)
{
k[i]=0;
}
}
else
{
cout<<"ILLEGAL_ERASE_ARGUMENT"<<endl;
}
}
if(d==c)
{
while(1)
{
int mark1=9999998,mark2=9999998,mark3=9999998;
for(int i=0;i<m;i++)
{
if(k[i]==0)
{
mark1=i;
break;
}
}
for(int i=mark1;i<m;i++)
{
if(k[i]!=0)
{
mark2=i;
break;
}
}
if(mark2!=9999998)
{
for(int i=mark2;k[i]==k[mark2];i++)
{
mark3=i;
}
int m=k[mark2];
for(int i=mark2;i<=mark3;i++)
{
k[i]=0;
}
for(int i=mark1;i<mark1+mark3-mark2+1;i++)
{
k[i]=m;
}
}
else
{
break;
}
}
}
}
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |