//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n,k;
vector<int> G[2002];
int dist[2002][2002];
void dfs(int u,int fa,int d,int x)
{
	dist[x][u]=d;
	for(auto v:G[u])
		if(v!=fa)
			dfs(v,u,d+1,x);
}
vector<int> order;
int ind[2002];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<n;i++)
	{
		int u,v;
		cin>>u>>v;
		G[u].pb(v);
		G[v].pb(u);
	}
	for(int i=1;i<=n;i++)
		dfs(i,0,0,i);
	queue<int> q;
	q.push(1);
	while(!q.empty())
	{
		int x=q.front();
		q.pop();
		order.pb(x);
		ind[x]=sz(order);
		for(auto y:G[x])
			if(!ind[y])
				q.push(y);
	}
	int l=1,r=n;
	while(l<r)
	{
		int mid=(l+r+1)/2;
		int ok=1;
		for(auto x:order)
		{
			int cnt=0;
			for(int i=1;i<=n;i++)
				if(ind[i]<ind[x]&&dist[i][x]<mid)
					cnt++;
			if(cnt>=k)
				ok=0;
		}
		if(ok)
			l=mid;
		else
			r=mid-1;
	}
	ll ans=1;
	const ll mod=998244353;
	for(auto x:order)
	{
		int cnt=0;
		for(int i=1;i<=n;i++)
			if(ind[i]<ind[x]&&dist[i][x]<l)
				cnt++;
		ans=ans*(k-cnt)%mod;
	}
	cout<<l<<" "<<ans<<'\n';
	return 0;
}