#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
const int N = 402;
int n, K, dp[N][N], sz[N], f[2][N];
pair<int, int> par[N];
vector<pair<int, int> > g[N];
vector<int> track[N][N];
void dfs(int u, int p) {
  for (pair<int, int> v : g[u])
    if (v.first != p) {
      par[v.first] = {u, v.second};
      dfs(v.first, u);
    }
  for (int i = (0); i <= (K); ++i) track[u][i].assign(((int)(g[u]).size()), 0);
  f[0][1] = 0;
  for (int i = (2); i <= (K); ++i) f[0][i] = N;
  int now = 0, lst = 1;
  sz[u] = 1;
  for (int j = (0); j <= (((int)(g[u]).size()) - 1); ++j) {
    pair<int, int> v = g[u][j];
    if (v.first == p) continue;
    now ^= 1, lst ^= 1;
    for (int i = (0); i <= (K); ++i) f[now][i] = N;
    for (int k = (sz[u]); k >= (1); --k)
      for (int kv = (min(K - k, sz[v.first])); kv >= (0); --kv) {
        if (f[now][k + kv] > f[lst][k] + dp[v.first][kv]) {
          f[now][k + kv] = f[lst][k] + dp[v.first][kv];
          track[u][k + kv][j] = kv;
        }
      }
    sz[u] += sz[v.first];
  }
  dp[u][0] = 1;
  for (int k = (1); k <= (K); ++k) {
    dp[u][k] = f[now][k];
  }
}
vector<int> res;
void solve(int u, int p, int k) {
  for (int j = (((int)(g[u]).size()) - 1); j >= (0); --j) {
    pair<int, int> v = g[u][j];
    if (v.first == p) continue;
    if (track[u][k][j] == 0)
      res.emplace_back(v.second);
    else {
      solve(v.first, u, track[u][k][j]);
      k -= track[u][k][j];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> K;
  for (int i = (2); i <= (n); ++i) {
    int u, v;
    cin >> u >> v;
    g[u].emplace_back(v, i - 1);
    g[v].emplace_back(u, i - 1);
  }
  dfs(1, 0);
  int ans = dp[1][K], ansi = 1;
  for (int i = (2); i <= (n); ++i)
    if (ans > dp[i][K] + 1) {
      ans = dp[i][K] + 1;
      ansi = i;
    }
  if (n == K)
    cout << "0";
  else {
    cout << ans << '\n';
    if (ansi != 1) res.emplace_back(par[ansi].second);
    solve(ansi, par[ansi].first, K);
    for (int v : res) cout << v << ' ';
  }
  return 0;
}
