PROGRAMMING:Special queue

Ordinary queues only have enqueue and dequeue operations, which respectively indicate adding elements at the end of the queue and removing elements at the head of the queue. Now add a new operation to the queue, deletemid, which means to delete the middle elements of the queue. For a queue with $$n $$elements, if $$n $$is even, the intermediate element is defined as * * the $$n / 2 $$element * * from the first to the last of the queue; If $$n $$is odd, the intermediate element is defined as * * the $$(n + 1) / 2 $$element * *. Now we give a series of queue operations and output the corresponding results.
###Input format:
In the first line, enter a positive integer of no more than $$10 ^ 6 $$$$$M $$and $$n $$to represent the number of instructions and queue capacity, respectively.
After that, $$M $$line, each line gives an instruction, which is one of the following three kinds of instructions:
EnQueue *elem*
DeQueue
DeleteMid
###Output format:
For each enqueue instruction, if it does not exceed the capacity of the queue, it does not output any information, otherwise it outputs' full queue 'in one line.
For each dequeue and deletemid instruction, if the queue is not empty, the corresponding element is taken out and output; Otherwise, output 'empty queue' in only one line.
Finally, output the elements in the queue from the first to the end of the queue in a row, separated by spaces. There must be no extra spaces at the end of the line.
###Input example:
```in
10 4
DeQueue
EnQueue 2
EnQueue 3
EnQueue 4
EnQueue 5
DeleteMid
DeleteMid
EnQueue 7
EnQueue 8
EnQueue 9
```
###Output example:
```out
Empty Queue
three
four
Full Queue
2 5 7 8
```







answer：If there is no answer, please comment