Problem: 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

Solution (in PYTHON3):

Solution:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	queue
# CreatedDate:  2020-07-08 17:27:31 +0900
# LastModified: 2020-07-08 17:38:55 +0900
#


import os
import sys
# import numpy as np
# import pandas as pd
from collections import deque


def main():
    n, q = map(int, input().split())
    big_queue = []
    for _ in range(n):
        p = deque()
        big_queue.append(p)

    for _ in range(q):
        query = list(map(int, input().split()))
        if len(query) == 3:
            big_queue[query[1]].append(query[2])
        else:
            if query[0] == 1:
                if big_queue[query[1]]:
                    print(big_queue[query[1]][0])
            else:
                if big_queue[query[1]]:
                    big_queue[query[1]].popleft()
        


if __name__ == "__main__":
    main()