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
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) {
		try(Scanner sc = new Scanner(System.in)) {
			ArrayList<Queue<Integer>> Q = new ArrayList<>();
			int n = sc.nextInt();
			for(int i = 0; i < n; i++) {
				Q.add(new LinkedList<Integer>());
			}
			int qn = sc.nextInt();
			for(int i = 0; i < qn; i++) {
				int q = sc.nextInt();
				switch(q) {  // 文字列に対し switch を使って良い
				case 0 /* enqueue(t)*/: {
					int t = sc.nextInt();
					int x = sc.nextInt();
					Q.get(t).add(x);
					break;  /* break を忘れない */
				}
				case 1 /* front(t) */: {
					int t = sc.nextInt();
					if(!Q.get(t).isEmpty()) {
						System.out.println(Q.get(t).peek());
					}
					break;  /* break を忘れない */
				}
				case 2: /* dequeue(t) */ {
					int t = sc.nextInt();
					if(!Q.get(t).isEmpty()) {
						Q.get(t).remove();
					}
					break;  /* break を忘れない */
				}
				}
			}
		}
	}
}
