//  只有最後一組過 全部才能晉級   

		}
		if(one==last)
		{
			last=rail;
			level++;
		}
		if(level==6) break;
	} 
    cout<<fixed<<setprecision(2)<<n<<": "<<(count*100*1.0)/Top<<"%"<<endl;
}

int main()
{    
	//memset(Edge,0,sizeof(Edge));
     //freopen("1.txt","r",stdin);
    int dian,bian;
    scanf("%d %d",&dian,&bian);
    CreatTop(dian);
    int i,j;
	for(i=1;i<=dian;i++)
    {
        Move[i] = false;
        for(j=1;j<=dian;j++)
        {
            Edge[i][j] = 0;
        }
    }



	CreatEdge(bian);
     
	for(i=1;i<=Top;i++)
	{    
		for(int j=1;j<=dian;j++)
        {
            Move[j] = false;
        }
		Bfs(i);
	}
 
    return 0;
}