#include <bits/stdc++.h>
using namespace std;
const int N = 401;
const int K = 401;
int n, k;
vector<int> adj[N];
int dp[N][K], d[N][K][K];
int parents[N];
int roads[N][N];
void dfs(int curr, int parent) {
  dp[curr][0] = 1;
  dp[curr][1] = 0;
  parents[curr] = parent;
  for (int i = 0; i < adj[curr].size(); i++) {
    if (adj[curr][i] != parent) {
      int child = adj[curr][i];
      dfs(child, curr);
      for (int c = n; c; c--) {
        int tmp = 1e9;
        for (int b = 0; b < c; b++) {
          int a = c - b;
          if (tmp > dp[curr][a] + dp[child][b]) {
            tmp = dp[curr][a] + dp[child][b];
            d[curr][c][i] = b;
          }
        }
        dp[curr][c] = tmp;
      }
    }
  }
}
void dfs2(int u, int p, int size) {
  for (int i = adj[u].size() - 1; i >= 0; i--) {
    int v = adj[u][i];
    if (v == p) continue;
    if (d[u][size][i]) {
      dfs2(v, u, d[u][size][i]);
    } else {
      cout << roads[u][v] << " ";
    }
    size -= d[u][size][i];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < K; j++) dp[i][j] = (int)1e9;
  }
  cin >> n >> k;
  for (int i = 1; i <= n - 1; i++) {
    int a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
    roads[a][b] = i;
    roads[b][a] = i;
  }
  dfs(1, 0);
  int ans = dp[1][k], best = 1;
  for (int i = 2; i <= n; i++) {
    if (ans > dp[i][k] + 1) {
      ans = dp[i][k] + 1;
      best = i;
    }
  }
  cout << ans << '\n';
  if (ans) {
    if (best != 1) cout << roads[best][parents[best]] << " ";
    dfs2(best, parents[best], k);
  }
  return 0;
}
