#include

using namespace std;

const int N=5001;

int father[N],n,m,j;

int find(int x)

{if(father[x]!=-1)

return father[x]=find(father[x]);

else

return x;

}

void out(int x,int y)

{int t1,t2;

t1=find(x);

t2=find(y);

if(t1==t2)

coutt2;

merge(t1,t2); }

for(i=1;i>t1>>t2;

out(t1,t2);}

return 00;

}