A download software can execute multiple tasks simultaneously. For each task, there might be four states: downloading, waiting, paused, or finished. And there can be at most n tasks with state downloading at the same time. At the very beginning, the software has no tasks. Then it will receive m pieces of instructions. The forms of instructions are as listed below:

• Sort asc: Set the priority in ascending order. The smallest name (in alphabet order) has the highest priority. This is the initial order.
• Sort desc: Set the priority in descending order. The biggest name (in alphabet order) has the highest priority.
• New A: Create a new task A. If the tasks with downloading state are less than n, set A's state with downloading, otherwise waiting.
• Pause A: Set the task A with state paused. And change the task of waiting state (if there is one) with the highest priority into a downloading state.
• Continue A: If the tasks with downloading state are less than n, set A with downloading, otherwise waiting.
• Finish A: Set the task A with state finished. And change the task of waiting state (if there is one) with the highest priority into a downloading state.

Now you need to program to simulate the download software, output the state of all the tasks according to the final priority after it has executed all the m pieces of instructions.

Assumption: Any two different tasks have different names. The task described in the New instruction has never existed before. The task described in the Pause instruction is either waiting or downloading. The task described in the Continue instruction is paused. The task described in the Finish instruction is downloading.