#include <bits/stdc++.h>
using namespace std;
const int MAXN = 405, INF = 1e9;
int k, dp[MAXN][MAXN], edge[MAXN][MAXN], atas[MAXN], opt[MAXN][MAXN];
bool masuk[MAXN];
vector<int> adj[MAXN];
void dfs(int now, int par) {
  atas[now] = par;
  dp[now][1] = adj[now].size();
  for (auto nxt : adj[now]) {
    if (nxt == par) continue;
    dfs(nxt, now);
    for (int i = k; i >= 2; i--) {
      for (int j = 1; j < i; j++) {
        if (dp[now][j] - 1 + dp[nxt][i - j] - 1 < dp[now][i]) {
          dp[now][i] = dp[now][j] - 1 + dp[nxt][i - j] - 1;
          opt[nxt][i] = i - j;
        }
      }
    }
  }
}
void backtrack(int now, int par, int val) {
  masuk[now] = true;
  for (int i = adj[now].size() - 1; i >= 0; i--) {
    int nxt = adj[now][i];
    if (nxt == par) continue;
    if (opt[nxt][val] != 0) backtrack(nxt, now, opt[nxt][val]);
    val -= opt[nxt][val];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, u, v;
  cin >> n >> k;
  for (int i = 1; i < n; i++) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
    edge[u][v] = i;
    edge[v][u] = i;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) dp[i][j] = INF;
  }
  dfs(1, -1);
  int ans = INF, root;
  for (int i = 1; i <= n; i++) {
    if (dp[i][k] < ans) {
      ans = dp[i][k];
      root = i;
    }
  }
  cout << ans << '\n';
  backtrack(root, atas[root], k);
  for (int i = 1; i <= n; i++) {
    for (auto j : adj[i]) {
      if (masuk[i] && !masuk[j]) cout << edge[i][j] << " ";
    }
  }
  cout << '\n';
  return 0;
}
