Problem:
Splice

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.

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.

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$

Sample Input 1

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

Sample Output 1

1 2 3 4 5

6

Solution in C# (judge verdict: Wrong Answer)

using System.Collections.Generic;
using System.Linq;
using System;

public class Hello
{
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var n = int.Parse(line[0]);
        var q = int.Parse(line[1]);
        var b = new int[1000, 100000];
        var p = new int[1000];
        var up = n ;
        var a = new List<int>[n];
        for (int i = 0; i < n; i++) a[i] = new List<int>() { i };
        for (int i = 0; i < q; i++)
        {
            line = Console.ReadLine().Trim().Split(' ');
            var c = int.Parse(line[0]);
            var c2 = int.Parse(line[1]);
            if (c == 0)
            {
                var c3 = int.Parse(line[2]);
                var p0 = getIndex(a, c2);
                b[p0, p[p0]++] = c3;
            }
            else if (c == 1) print(a, b, p, c2);
            else
            {
                var c3 = int.Parse(line[2]);
                a[c3].AddRange(a[c2]);
                a[c2].Clear();
                a[c2].Add(up++);
            }
        }
    }
    public static void print(List<int>[] a, int[,] b, int[] p, int k)
    {
        var endf = false;
        var ac = a[k].Count();
        for (int i = 0; i < ac; i++)
        {
            if (i == ac - 1) endf = true;
            var w = a[k][i];
            if (p[w] == 0 ) { Console.WriteLine(); return; }
            for (int j = 0; j < p[w]; j++)
            {
                if (!endf) Console.Write("{0} ", b[w, j]);
                else
                {
                    if (j == p[w] - 1) Console.WriteLine(b[w,j]);
                    else Console.Write("{0} ", b[w, j]);
                }
            }
        }
    }
    public static int getIndex(List<int>[] a, int b)
    {
        var c = a[b].Count();
        return a[b][c - 1];
    }
}