#include<fstream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define max_n 200000
#define max_m 400000
int n,m,i,j,x,y,c,cost,rez,k,nr,q;
struct costuri
{
    int x,y,c;
};
costuri a,b;
costuri muchie[max_m];
int T[max_n], rang[max_n];
bool ok[max_n];
int sol[max_m][i];
inline bool cm(const costuri &a, const costuri &b)
{
    return a.c<b.c;
}
inline int multime(int nod)
{
    if(T[nod]!=nod)
    T[nod]=multime(T[nod]);
    return T[nod];
}
void reuneste(int i, int j)
{
    i=multime(i);
    j=multime(j);
    if(i==j)
    return ;
    if(rang[i]<rang[j])
    T[i]=j;
    else T [j]=i;
    if(rang[i]==rang[j])
    rang[i]++;
}
int main()
{
    freopen("apm.in","f",stdin);
    freopen("apm.out","g",stdout);
    scanf("%d%d",&n,&m);
}