#include <iostream>
#include <vector>
using namespace std;
#define END 1000000001

struct node {
	int val;
	node* before;
	node* after;
};
typedef struct node* Node;

class List {
public:
	Node root;

	List();
	void insert(int x);
	void dump();

	bool empty();
};

List::List() {
	this->root = new node;
	root->val = END;
	root->after = root;
	root->before = root;
	return;
}

void List::insert(int x) {
	Node n = new node;
	root->before->after = n;
	n->before = root->before;
	n->after = root;
	root->before = n;
	n->val = x;
}

bool List::empty() {
	return (root->after == root);
}

void List::dump() {
	Node cur = root->after;
	int num = 0;
	while (cur != root) {
		cout << (num == 0 ? "" : " ") << cur->val << flush;
		cur = cur->after;
		num++;
	}
	cout << endl;
	return;
}

void splice(List s, List t) {
	if (s.empty()) return;
	if (t.empty()) {
		s.root->after->before = t.root;
		s.root->before->after = t.root;
		t.root->after = s.root->after;
		t.root->before = s.root->before;
		s.root->before = s.root;
		s.root->after = s.root;
		return;
	}
	Node s_root_after = s.root->after;
	Node s_root_before = s.root->before;
	Node t_root_after = t.root->after;
	Node t_root_before = t.root->before;
	s.root->after = s.root;
	s.root->before = s.root;
	t.root->after = t_root_after;
	t.root->before = s_root_before;
	s_root_after->before = t_root_before;
	s_root_before->after = t.root;
	t_root_after->before = t.root;
	t_root_before->after = s_root_after;
	return;
}

using namespace std;

int main(){

	int n, q;
	cin >> n >> q;
	vector< List > a(n);
	int querynum = 0;
	while (querynum < q) {
		int var1;
		cin >> var1;
		if (var1 == 0) {
			int var2, var3;
			cin >> var2 >> var3;
			a[var2].insert(var3);
		}
		else if (var1 == 1) {
			int var2;
			cin >> var2;
			a[var2].dump();
		}
		else {
			int var2, var3;
			cin >> var2 >> var3;
			splice(a[var2], a[var3]);
		}
		querynum++;
	}
	
	return 0;
}

### Prompt

In CPP, your task is to solve the following problem:

For $n$ lists $L_i$ $(i = 0, 1, ..., n-1)$, perform a sequence of the following operations.

* insert($t$, $x$): Insert an integer $x$ at the end of $L_t$.
* dump($t$): Print all elements in $L_t$.
* splice($s$, $t$): Transfer elements of $L_s$ to the end of $L_t$. $L_s$ becomes empty.



In the initial state, $L_i$ $(i = 0, 1, ..., n-1)$ are empty.

Constraints

* $1 \leq n \leq 1,000$
* $1 \leq q \leq 500,000$
* For a splice operation, $s \ne t$
* For a splice operation, $L_s$ is not empty
* The total number of elements printed by dump operations do not exceed 1,000,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 $s$ $t$


where the first digits 0, 1 and 2 represent insert, dump and splice operations respectively.

Output

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

Example

Input

3 10
0 0 1
0 0 2
0 0 3
0 1 4
0 1 5
2 1 0
0 2 6
1 0
1 1
1 2


Output

1 2 3 4 5

6

### Response

```cpp
#include <iostream>
#include <vector>
using namespace std;
#define END 1000000001

struct node {
	int val;
	node* before;
	node* after;
};
typedef struct node* Node;

class List {
public:
	Node root;

	List();
	void insert(int x);
	void dump();

	bool empty();
};

List::List() {
	this->root = new node;
	root->val = END;
	root->after = root;
	root->before = root;
	return;
}

void List::insert(int x) {
	Node n = new node;
	root->before->after = n;
	n->before = root->before;
	n->after = root;
	root->before = n;
	n->val = x;
}

bool List::empty() {
	return (root->after == root);
}

void List::dump() {
	Node cur = root->after;
	int num = 0;
	while (cur != root) {
		cout << (num == 0 ? "" : " ") << cur->val << flush;
		cur = cur->after;
		num++;
	}
	cout << endl;
	return;
}

void splice(List s, List t) {
	if (s.empty()) return;
	if (t.empty()) {
		s.root->after->before = t.root;
		s.root->before->after = t.root;
		t.root->after = s.root->after;
		t.root->before = s.root->before;
		s.root->before = s.root;
		s.root->after = s.root;
		return;
	}
	Node s_root_after = s.root->after;
	Node s_root_before = s.root->before;
	Node t_root_after = t.root->after;
	Node t_root_before = t.root->before;
	s.root->after = s.root;
	s.root->before = s.root;
	t.root->after = t_root_after;
	t.root->before = s_root_before;
	s_root_after->before = t_root_before;
	s_root_before->after = t.root;
	t_root_after->before = t.root;
	t_root_before->after = s_root_after;
	return;
}

using namespace std;

int main(){

	int n, q;
	cin >> n >> q;
	vector< List > a(n);
	int querynum = 0;
	while (querynum < q) {
		int var1;
		cin >> var1;
		if (var1 == 0) {
			int var2, var3;
			cin >> var2 >> var3;
			a[var2].insert(var3);
		}
		else if (var1 == 1) {
			int var2;
			cin >> var2;
			a[var2].dump();
		}
		else {
			int var2, var3;
			cin >> var2 >> var3;
			splice(a[var2], a[var3]);
		}
		querynum++;
	}
	
	return 0;
}

```