#include 
using namespace std;

const int N = 10010;
int fa[N];

inline void init(int n)
{
    for (int i = 1; i > n >> m;
    init(n);
    for (int i = 1; i > child >> parent;
        merge(child, parent);
    }
    for (int i = 1; i <= n; i++)
    {
        cout << find(i) << " ";
    }
    return 0;
}