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 JAVA):

Solution:
import java.util.Scanner;

// Main
class Main {
	static final int INIT = 8;
	static int[] grow(int[] s) {
		int[] d = new int[s.length * 2];
		System.arraycopy(s, 0, d, 0, s.length);
		return d;
	}

	static class Queue {
		private int[] data;
		private int r, w;
		public Queue() {
			data = new int[INIT];
			// r 読み込み
			// w 書き込み
		}
		public boolean isEmpty() {
			return r == w;
		}
		public void enqueue(int x) {
			if (w >= data.length) {
				data = grow(data);
			}
			data[w++] = x;
		}
		public int getFront() {
			return data[r];
		}
		public void dequeue() {
			if (!isEmpty()) {
				r++;
			}
		}
	}

	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			int n = sc.nextInt();
			Queue[] qq = new Queue[n];
			for (int i = 0; i < n; i++) {
				qq[i] = new Queue();
			}
			int q = sc.nextInt();
			for (int i = 0; i < q; i++) {
				int c = sc.nextInt();
				int t = sc.nextInt();
				switch (c) {
				case 0:
					int x = sc.nextInt();
					qq[t].enqueue(x);
					break;
				case 1:
					if (!qq[t].isEmpty()) {
						System.out.println(Integer.toString(qq[t].getFront()));
					}
					break;
				case 2:
					qq[t].dequeue();
					break;
				}
			}
		}
	}
}