//永远只用根节点做
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<cstring>
#include <climits>
#include <set>
#include <algorithm>
#define MAXN 10005
#define maxn 80005
using namespace std;
int parent[MAXN];//每个节点的父亲
int dfn[MAXN];
int low[MAXN];
int flag;
set<int> it;
typedef struct{
int to;
int next;
}Edge;
typedef struct
{
int n;
int num;
}NODE;
bool cmp(const NODE a,const NODE b)
{
if (a.num!=b.num) return a.num>b.num;
return a.n<b.n;
}
Edge edge[maxn];
NODE node[MAXN];
int head[MAXN];
bool visit[MAXN];
int edge_sum;
int N,M;
void addedge(int s,int t)
{
edge[edge_sum].to=t;
edge[edge_sum].next=head[s];
head[s]=edge_sum++;
}
void init()
{
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
memset(visit,0,sizeof(visit));
for(int i=0;i<N;i++)
parent[i]=i;
}
void dfs(int u)
{
//记录dfs遍历次序
static int counter = 0;
//记录节点u的子树数
int children = 0;
int i;
visit[u] = 1;
//初始化dfn与low
dfn[u] = low[u] = ++counter;
for(i=head[u]; i!=-1; i=edge[i].next) {
int v = edge[i].to;
//节点v未被访问,则(u,v)为树边
if(!visit[v]) {
children++;
parent[v] = u;
dfs(v);
low[u] = min(low[u], low[v]);
if(parent[u]==u && children > 1)
{
node[u].num=children;
}
else if(parent[u] !=u && low[v] >= dfn[u]&&flag==1)
{
it.insert(u);
}
}
//节点v已访问,则(u,v)为回边
else if(v != parent[u])
{
low[u] = min(low[u], dfn[v]);
}
}
}
int main()
{
while(~scanf("%d%d",&N,&M)&&N&&M)
{
flag=0;
it.clear();
memset(head,-1,sizeof(head));
for(int i=0;i<N;i++)//对数据进行初始化
{
node[i].n=i;
node[i].num=1;
}
init();
edge_sum=0;
int k1,k2;//表示两个顶之间有边
while(scanf("%d%d",&k1,&k2)==2&&k1!=-1&&k2!=-1)
{
addedge(k1,k2);
addedge(k2,k1);
}
flag=1;
dfs(0);
flag=0;
for(set<int>::iterator p=it.begin();p!=it.end();p++)
{
init();
dfs(*p);
}
sort(node,node+N,cmp);
for(int i=0;i<M;i++)
printf("%d %d\n",node[i].n,node[i].num);
printf("\n");
}
return 0;
}
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<cstring>
#include <climits>
#include <set>
#include <algorithm>
#define MAXN 10005
#define maxn 80005
using namespace std;
int parent[MAXN];//每个节点的父亲
int dfn[MAXN];
int low[MAXN];
int flag;
set<int> it;
typedef struct{
int to;
int next;
}Edge;
typedef struct
{
int n;
int num;
}NODE;
bool cmp(const NODE a,const NODE b)
{
if (a.num!=b.num) return a.num>b.num;
return a.n<b.n;
}
Edge edge[maxn];
NODE node[MAXN];
int head[MAXN];
bool visit[MAXN];
int edge_sum;
int N,M;
void addedge(int s,int t)
{
edge[edge_sum].to=t;
edge[edge_sum].next=head[s];
head[s]=edge_sum++;
}
void init()
{
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
memset(visit,0,sizeof(visit));
for(int i=0;i<N;i++)
parent[i]=i;
}
void dfs(int u)
{
//记录dfs遍历次序
static int counter = 0;
//记录节点u的子树数
int children = 0;
int i;
visit[u] = 1;
//初始化dfn与low
dfn[u] = low[u] = ++counter;
for(i=head[u]; i!=-1; i=edge[i].next) {
int v = edge[i].to;
//节点v未被访问,则(u,v)为树边
if(!visit[v]) {
children++;
parent[v] = u;
dfs(v);
low[u] = min(low[u], low[v]);
if(parent[u]==u && children > 1)
{
node[u].num=children;
}
else if(parent[u] !=u && low[v] >= dfn[u]&&flag==1)
{
it.insert(u);
}
}
//节点v已访问,则(u,v)为回边
else if(v != parent[u])
{
low[u] = min(low[u], dfn[v]);
}
}
}
int main()
{
while(~scanf("%d%d",&N,&M)&&N&&M)
{
flag=0;
it.clear();
memset(head,-1,sizeof(head));
for(int i=0;i<N;i++)//对数据进行初始化
{
node[i].n=i;
node[i].num=1;
}
init();
edge_sum=0;
int k1,k2;//表示两个顶之间有边
while(scanf("%d%d",&k1,&k2)==2&&k1!=-1&&k2!=-1)
{
addedge(k1,k2);
addedge(k2,k1);
}
flag=1;
dfs(0);
flag=0;
for(set<int>::iterator p=it.begin();p!=it.end();p++)
{
init();
dfs(*p);
}
sort(node,node+N,cmp);
for(int i=0;i<M;i++)
printf("%d %d\n",node[i].n,node[i].num);
printf("\n");
}
return 0;
}