Queue is a container of elements that are inserted and deleted according to FIFO (First In First Out).

For $n$ queues $Q_i$ ($i = 0, 1, ..., n-1$), perform a sequence of the following operations.

* enqueue($t$, $x$): Insert an integer $x$ to $Q_t$.
* front($t$): Report the value which should be deleted next from $Q_t$. If $Q_t$ is empty, do nothing.
* dequeue($t$): Delete an element from $Q_t$. If $Q_t$ is empty, do nothing.



In the initial state, all queues are empty.

Constraints

* $1 \leq n \leq 1,000$
* $1 \leq q \leq 200,000$
* $-1,000,000,000 \leq x \leq 1,000,000,000$

Input

The input is given in the following format.


$n \; q$
$query_1$
$query_2$
:
$query_q$


Each query $query_i$ is given by


0 $t$ $x$


or


1 $t$


or


2 $t$


where the first digits 0, 1 and 2 represent enqueue, front and dequeue operations respectively.

Output

For each front operation, print an integer in a line.

Example

Input

3 9
0 0 1
0 0 2
0 0 3
0 2 4
0 2 5
1 0
1 2
2 0
1 0


Output

1
4
2
from sys import stdin

class QueueNode(object):
	def __init__(self,data,next=None):
		self.data = data
		self.next = next

class LinkList(object):
	def __init__(self,head=None):
		self.head = head
		self.tail = head

	#後ろに挿入する
	def insert_q(self,data):
		node = QueueNode(data)

		if self.head is None:
			self.head = node
			self.tail = node
			return

		currentNode = self.tail

		while True:
			if currentNode.next is None:
				currentNode.next = node
				self.tail = node
				break
			currentNode = currentNode.next

	#先頭を削除する
	def delete_q(self):
		if self.head is not None:
			currentNode = self.head
			self.head = currentNode.next

	#先頭を表示する
	def print_q(self):
		if self.head is not None:
			print(self.head.data)

if __name__ == '__main__':

	qnum,loopnum = map(int,input().split(" "))

	q = [LinkList() for i in range(qnum)]

	for i in range(loopnum):
		cmd = stdin.readline().strip().split()
		t = int(cmd[1])
		if cmd[0] == "0":
			q[t].insert_q(int(cmd[2]))
		elif cmd[0] == "1":
			q[t].print_q()
		else:
			q[t].delete_q()



