#include <bits/stdc++.h>
#define Nmax 1002
using namespace std;

ifstream fin("salvare.in");
ofstream fout("salvare.out");

int N, K, nr, ans;
int dp[Nmax];
vector<int> G[Nmax], towers, curr;
bool vis[Nmax];

void DFS(int node, int father, int val) {
    bool sons = 0;
    dp[node] = 0;
    for (auto it: G[node]) {
        if (it == father) continue;
        sons = 1;
        DFS(it, node, val);
        dp[node] = max(dp[it], dp[node]);
    }

    if (sons) {
        dp[node]++;
        if (dp[node] == val) dp[node] = 0, ++nr, vis[node] = 1;
    }
}

bool check(int i, int val) {
    nr = 0;
    memset(vis, 0, sizeof(vis));
    DFS(i, 0, val);
    if (nr > K) return 0;

    if (val < ans) {
        ans = val;
        towers.clear();
        for (int j = 1; j <= N; ++j)
            if (vis[j]) towers.push_back(j);
            else if (nr < K) ++nr, towers.push_back(j);
    }
     return 1;
}
void solve(int i) {
    int le = 1, ri = N;
    while (le <= ri) {
        int mid = (le + ri) / 2;
        if (check(i, mid)) ri = mid - 1;
        else le = mid + 1;
    }
}
int main()
{
    fin >> N >> K;
    for (int i = 1; i < N; ++i) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    ans = N;
    for (int i = 1; i <= N; ++i)
        solve(i);

    fout << ans << '\n';
    sort(towers.begin(), towers.end());
    for (auto it: towers)
         fout << it << " ";

    return 0;
}