#include <fstream>
#include <vector>
#include <string.h>
#include <algorithm>
#define Nmax 1005
#define INF 1000000000
#define pb push_back

using namespace std;

ifstream cin("salvare.in");
ofstream cout("salvare.out");

vector <int> G[Nmax],ans,v;
int n,k,d[Nmax];
bool viz[Nmax];

void DFS(int nod, int tata, int D);

int main()
{
    cin>>n>>k;

    for(int i=1;i<n;++i)
    {
        int x,y;
        cin>>x>>y;
        G[x].pb(y); G[y].pb(x);
    }
    int st=0,dr=n-1,mij,sol;
    while(st<=dr)
    {
        mij=((st+dr)>>1);
        v.clear();
        DFS(1,0,mij);
        if(v.size()<=k)
        {
            sol=mij;
            ans=v;
            dr=mij-1;
        }
        else st=mij+1;
    }

    cout<<sol<<"\n";

    for(auto it : ans) viz[it]=1;
    for(int i=1;i<=n && ans.size()<k;++i)
        if(!viz[i]) ans.pb(i);

    sort(ans.begin(),ans.end());

    for(auto it : ans) cout<<it<<" ";
    cout<<"\n";

    return 0;
}

void DFS(int nod, int tata, int D)
{
    int neg=INF,poz=-1;
    for(auto it : G[nod])
        if(it!=tata)
        {
            DFS(it,nod,D);
            if(d[it]<0) neg=min(neg,d[it]);
            else poz=max(poz,d[it]);
        }

    if(poz==-1)
    {
        if(neg==INF) d[nod]=0;
        else d[nod]=neg+1;
    }
    else
    {
        if(poz+1 <= -neg-2) d[nod]=neg+1;
        else d[nod]=poz+1;
    }

    if(d[nod]==D || (!tata && d[nod]>=0))
    {
        v.pb(nod);
        d[nod]=-(D+1);
    }
}