#include<fstream>
#include<vector>
#include<deque>
using namespace std;
class dq
{
public:
	int d;
};
ifstream fi("hideseek.in");
ofstream fo("hideseek.out");
int main()
{
	vector<dq> adj[20001];
	int n,m,o,p;
	dq de;
	fi>>n>>m;
	for(int i=1;i<=m;i++)
	{
		fi>>o>>p;
		de.d=p;
		adj[o].push_back(de);
		de.d=o;
		adj[p].push_back(de);
	}
	deque<int> di;
	int dd[20001];
	int max=200000000;
	for(int i=2;i<=n;i++)
		dd[i]=max;
	dd[1]=0;
	di.push_back(1);
	while(!di.empty())
	{
		int a=di.front();
		di.pop_front();
		for(int i=0;i<adj[a].size();i++)
		{
			if(dd[a]+1<dd[adj[a][i].d])
			{
				dd[adj[a][i].d]=dd[a]+1;
				di.push_back(adj[a][i].d);
			}
		}
	}
	int mmax=0,pe,ss=1;
	for(int i=2;i<=n;i++)
	{
		if(dd[i]==max)
			dd[i]=0;
		if(dd[i]>mmax)
		{
			mmax=dd[i];
			pe=i;
			ss=1;
		}
		else
			if(dd[i]==mmax)
				ss++;
	}
	fo<<pe<<" "<<mmax<<" "<<ss<<endl;
	return 0;
}