#include <iostream>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <list>
#include <algorithm>
#include <map>
#include <numeric>
#include <iomanip>

using namespace std;

/* typedef */

typedef long long ll;

/* constant */

const int INF = 1 << 30;
const int MAX = 100;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */

/* function */

/* main */
int main() {

    int n; cin >> n;
    vector< list<int> > v(n, list<int>());
    int q; cin >> q;
    while (q--) {

        int op; cin >> op;
        int t; cin >> t;

        if (op == 0) {
            int x; cin >> x;
            v[t].push_back(x);

        }
        else if (op == 1) {
            if (v[t].empty()) {
                cout << '\n';
                continue;
            }
            list<int>::iterator itr = v[t].begin();
            cout << *itr;
            itr++;
            for (;itr != v[t].end(); itr++) {
                cout << ' ' << *itr;
            }
            cout << '\n';
        }
        else {
            int s; cin >> s;
            swap(s, t);
            if (v[s].empty())
                continue;
            v[t].splice(v[t].end(), move(v[s]));
            v[s].clear();
        }
    }
}


### Prompt

Construct a Cpp code solution to the problem outlined:

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 <cstdio>
#include <cmath>
#include <cctype>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <list>
#include <algorithm>
#include <map>
#include <numeric>
#include <iomanip>

using namespace std;

/* typedef */

typedef long long ll;

/* constant */

const int INF = 1 << 30;
const int MAX = 100;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */

/* function */

/* main */
int main() {

    int n; cin >> n;
    vector< list<int> > v(n, list<int>());
    int q; cin >> q;
    while (q--) {

        int op; cin >> op;
        int t; cin >> t;

        if (op == 0) {
            int x; cin >> x;
            v[t].push_back(x);

        }
        else if (op == 1) {
            if (v[t].empty()) {
                cout << '\n';
                continue;
            }
            list<int>::iterator itr = v[t].begin();
            cout << *itr;
            itr++;
            for (;itr != v[t].end(); itr++) {
                cout << ' ' << *itr;
            }
            cout << '\n';
        }
        else {
            int s; cin >> s;
            swap(s, t);
            if (v[s].empty())
                continue;
            v[t].splice(v[t].end(), move(v[s]));
            v[s].clear();
        }
    }
}


```