#include <iostream>
#include <cstdio>
using namespace std;

struct QueueOfInt {
	int max;
	int *value;
	int front;
	int rear;
	int count;
	QueueOfInt() {
		max = 100;
		count = 0;
		value = new int[max];
		front = 1;
		rear = 0;
	}
	void push(int x) {
		if (count > 0.9 * max) {
			int *temp = value;
			value = new int[max * 2];
			int i, j;
			for (i = 1, j = front; i <= count; i++, j = (j + 1) % max)
				value[i] = temp[j];
			front = 1;
			rear = count;
			max = max * 2;
			delete[] temp;
		}
		rear = (rear + 1) % max;
		count++;
		value[rear] = x;
	}
	int top() {
		return value[front];
	}
	void pop() {
		if (max != 100 && count < 0.1) {
			int *temp = value;
			value = new int[max / 2];
			int i, j;
			for (i = 1, j = front; i < count; i++, j = (j + 1) % max)
				value[i] = temp[j];
			max = max / 2;
			front = 1;
			rear = count;
			delete[] temp;
		}
		front = (front + 1) % max;
		count--;
	}
	bool empty() {
		return count == 0;
	}
};

struct ArrayOfQueue {
	QueueOfInt *value;
	int n;
	ArrayOfQueue(int x) {
		n = x;
		value = new QueueOfInt[n];
	}
	void enqueue(int t, int x) {
		value[t].push(x);
	}
	int front(int t) {
		return value[t].top();
	}
	void dequeue(int t) {
		value[t].pop();
	}
	bool empty(int t) {
		return value[t].empty();
	}
};

int main(void) {
	int n, q, com, t, x;
	cin >> n >> q;
	ArrayOfQueue ar(n);
	while (q--) {
		cin >> com >> t;
		if (com == 0) {
			cin >> x;
			ar.enqueue(t, x);
		} else if (com == 1) {
			if (!ar.empty(t))
				cout << ar.front(t) << endl;
		} else {
			if (!ar.empty(t))
				ar.dequeue(t);
		}
	}
}

### Prompt

Develop a solution in CPP to the problem described below:

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

### Response

```cpp
#include <iostream>
#include <cstdio>
using namespace std;

struct QueueOfInt {
	int max;
	int *value;
	int front;
	int rear;
	int count;
	QueueOfInt() {
		max = 100;
		count = 0;
		value = new int[max];
		front = 1;
		rear = 0;
	}
	void push(int x) {
		if (count > 0.9 * max) {
			int *temp = value;
			value = new int[max * 2];
			int i, j;
			for (i = 1, j = front; i <= count; i++, j = (j + 1) % max)
				value[i] = temp[j];
			front = 1;
			rear = count;
			max = max * 2;
			delete[] temp;
		}
		rear = (rear + 1) % max;
		count++;
		value[rear] = x;
	}
	int top() {
		return value[front];
	}
	void pop() {
		if (max != 100 && count < 0.1) {
			int *temp = value;
			value = new int[max / 2];
			int i, j;
			for (i = 1, j = front; i < count; i++, j = (j + 1) % max)
				value[i] = temp[j];
			max = max / 2;
			front = 1;
			rear = count;
			delete[] temp;
		}
		front = (front + 1) % max;
		count--;
	}
	bool empty() {
		return count == 0;
	}
};

struct ArrayOfQueue {
	QueueOfInt *value;
	int n;
	ArrayOfQueue(int x) {
		n = x;
		value = new QueueOfInt[n];
	}
	void enqueue(int t, int x) {
		value[t].push(x);
	}
	int front(int t) {
		return value[t].top();
	}
	void dequeue(int t) {
		value[t].pop();
	}
	bool empty(int t) {
		return value[t].empty();
	}
};

int main(void) {
	int n, q, com, t, x;
	cin >> n >> q;
	ArrayOfQueue ar(n);
	while (q--) {
		cin >> com >> t;
		if (com == 0) {
			cin >> x;
			ar.enqueue(t, x);
		} else if (com == 1) {
			if (!ar.empty(t))
				cout << ar.front(t) << endl;
		} else {
			if (!ar.empty(t))
				ar.dequeue(t);
		}
	}
}

```