#include<bits/stdc++.h>
#define fi first
#define sc second
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int T[100001], R[100001], n, m, a, b;
int find1(int x)
{
    int R, y;
    for(R=x; T[R]!=R; R=T[R])
        for(; T[x]!=x ;)
    {
        y=T[x];
        T[x]=R;
        x=y;
    }
    return R;
}
int main()
{
    f>>n>>m;

    return 0;
}