#include <iostream>
#include <string>
#include <queue>
using namespace std;
static int map[1002][1002];//定义矩阵，static省去初始化
int BFS(int i);
int n, e;
int main()
{
	cin >> n >> e;
	int i;
	for (i = 1; i <= e; i++)
	{
		int a, b;
		cin >> a >> b;
		map[a][b] = 1;
		map[b][a] = 1;
	}
	int count=0;
	double num;
	for (i = 1; i <= n; i++)
	{
		count = BFS(i);//计算数量
		num = count * 100.0 / n;
		printf("%d: %.2f%\n", i, num);
	}
	return 0;
}
int BFS(int i)//广度遍历
{
	bool visited[10002] = {false};//定义visited来储存已访问的结点
	queue<int>q;
	q.push(i);
	visited[i] = 1;
	int level = 0;//层数
	int count = 1;
	int last =i;
	int tail;
	while (!q.empty())
	{
		i = q.front();
		q.pop();
		for (int j = 1; j <= n; j++)
		{
			if (!visited[j] && map[i][j] == 1)
			{
				q.push(j);
				count++;
				visited[j] = true;
				tail = j;
			}
		}
        if (last == i)//判断是否为该层最后一个
		{
			level++;
			last = tail;//移动到下一层
		}
		if (level == 6)
		{
			return count;
		}
	}
	return count;
}