You have a queue with size n. Now there are m operations. Each operation will be one of the following cases:
Push x: If the queue is not full, push x into the queue. Otherwise print x.
Pop: If the queue has at least one element, print and pop the front element of the queue. Otherwise do nothing.
After the m operations, you should print all elements in the queue from the front.
Please write a program to print the elements in the order problem described.