Problem: For $n$ dynamic arrays $A_i$ ($i = 0, 1, ..., n-1$), perform a sequence of the following operations:

* pushBack($t$, $x$): Add element $x$ at the end of $A_t$.
* dump($t$): Print all elements in $A_t$.
* clear($t$): Clear $A_t$. If $A_t$ is empty, do nothing.



$A_i$ is a 0-origin array and it is empty in the initial state.

Constraints

* $1 \leq n \leq 1,000$
* $1 \leq q \leq 500,000$
* $-1,000,000,000 \leq x \leq 1,000,000,000$
* The total number of elements printed by dump operations do not exceed 500,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 pushBack, dump and clear operations respectively.

Output

For each dump operation, print elements of $A_t$ a line. Separete adjacency elements by a space character (do not print the space after the last element). Note that, if the array is empty, an empty line should be printed.

Example

Input

3 13
0 0 1
0 0 2
0 0 3
0 1 -1
0 2 4
0 2 5
1 0
1 1
1 2
2 1
1 0
1 1
1 2


Output

1 2 3
-1
4 5
1 2 3

4 5

Solution (in CPP):

Solution:
using namespace std;
#include <iostream>
//#include <algorithm>
//#include <string>
#include <vector>
//#include <deque>

int main()
{
	int n, q;
	cin >> n >> q;
	vector<int> A[1000];  // A[n] とするとエラー

	int a0, a1, a2;

	for (int i = 0; i < q; i++) {
		cin >> a0 >> a1;

		switch (a0) {
		case 0:
			cin >> a2;
			A[a1].push_back(a2);
			break;

		case 1:
			for (int i = 0; i < A[a1].size(); i++) {
				cout << A[a1][i];
				if (i != A[a1].size() - 1) cout << " ";
			}
			cout << endl;
			break;

		case 2:
			A[a1].clear();
			break;
		}
	}
}