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

class Node:
    def __init__(self, value):
        self.value = value
        self.next = None


class Queue:
    def __init__(self):
        self.first = None
        self.last = None

    def enqueue(self, value):
        if value is None:
            raise ValueError('enqueue None')
        node = Node(value)
        if self.last is not None:
            self.last.next = node
        self.last = node
        if self.first is None:
            self.first = node

    def front(self):
        if self.first is None:
            return None
        return self.first.value

    def dequeue(self):
        if self.first is None:
            return None
        value = self.first.value
        if self.first == self.last:
            self.last = None
        self.first = self.first.next
        return value


def run():
    n, nq = [int(x) for x in input().split()]
    qs = [Queue() for _ in range(n)]

    for _ in range(nq):
        line = input()
        if line.startswith('0'):
            command, target, value = [int(x) for x in line.split()]
            qs[target].enqueue(value)
        elif line.startswith('1'):
            command, target = [int(x) for x in line.split()]
            value = qs[target].front()
            if value is not None:
                print(value)
        elif line.startswith('2'):
            command, target = [int(x) for x in line.split()]
            qs[target].dequeue()
        else:
            raise ValueError('invalid command')


if __name__ == '__main__':
    run()

