#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
const int N = 400 + 10;
vector<pair<int, int> > a[N];
int dp[N][N];
vector<pair<int, int> > rec[N][N];
int m;
void DFS(int u, int parent) {
  fill(dp[u], dp[u] + m + 1, INF);
  dp[u][1] = 0;
  for (auto& it : a[u]) {
    int v = it.first;
    if (v == parent) continue;
    DFS(v, u);
    for (int i = m; i >= 1; --i) {
      dp[u][i]++;
      for (int j = 1; j < i; ++j) {
        if (dp[v][j] + dp[u][i - j] < dp[u][i]) {
          dp[u][i] = dp[v][j] + dp[u][i - j];
          rec[u][i] = rec[u][i - j];
          rec[u][i].emplace_back(v, j);
        }
      }
    }
  }
}
bool visit[N];
vector<int> edges;
void print(int u, int k) {
  visit[u] = true;
  for (auto& it : rec[u][k]) {
    print(it.first, it.second);
  }
  for (auto& it : a[u]) {
    int v = it.first, k = it.second;
    if (!visit[v]) edges.push_back(k);
  }
}
int main() {
  int n;
  scanf("%d%d", &n, &m);
  for (int i = 1; i < n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    --x;
    --y;
    a[x].emplace_back(y, i);
    a[y].emplace_back(x, i);
  }
  DFS(0, -1);
  int ret = dp[0][m], best = 0;
  for (int i = 1; i < n; ++i) {
    if (ret > dp[i][m] + 1) {
      ret = dp[i][m] + 1;
      best = i;
    }
  }
  print(best, m);
  printf("%d\n", ret);
  for (int i = 0; i < edges.size(); ++i) {
    printf("%d%c", edges[i], " \n"[i + 1 == edges.size()]);
  }
  return 0;
}
