#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 62;
const int mods = 1e9 + 7;
const int MAXN = 405;
const int INF = 0x3f3f3f3f;
inline long long read() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
pair<int, int> ID[MAXN];
int ans = INF, f[MAXN][MAXN], tmp[MAXN], n, k, sz[MAXN], id, frm[MAXN][MAXN],
    fa[MAXN], flag[MAXN];
vector<int> e[MAXN], Ans;
void dfs(int x, int father) {
  fa[x] = father;
  for (auto v : e[x])
    if (v != father) dfs(v, x);
  sz[x] = 1, f[x][1] = e[x].size() - (x != 1);
  for (int j = 2; j <= n; j++) f[x][j] = INF;
  for (auto v : e[x]) {
    for (int j = 0; j <= sz[x] + sz[v]; j++) tmp[j] = f[x][j];
    for (int j = sz[x]; j >= 1; j--)
      for (int k = 0; k <= sz[v]; k++)
        if (upmin(tmp[j + k], f[x][j] + f[v][k] + (!k))) frm[v][j + k] = k;
    for (int j = 0; j <= sz[x] + sz[v]; j++) f[x][j] = tmp[j];
    sz[x] += sz[v];
  }
  if (upmin(ans, f[x][k] + (x != 1))) id = x;
}
void solve(int x, int k) {
  if (!k) return;
  flag[x] = 1;
  for (int i = e[x].size() - 1; i >= 0; i--) {
    int v = e[x][i];
    if (v == fa[x]) continue;
    solve(v, frm[v][k]);
    k -= frm[v][k];
  }
}
signed main() {
  n = read(), k = read();
  for (int i = 1, u, v; i < n; i++)
    u = read(), v = read(), e[u].push_back(v), e[v].push_back(u),
    ID[i] = make_pair(u, v);
  dfs(1, 0);
  solve(id, k);
  for (int i = 1; i < n; i++)
    if (flag[ID[i].first] ^ flag[ID[i].second]) Ans.push_back(i);
  printf("%d\n", Ans.size());
  for (auto v : Ans) printf("%d ", v);
  return 0;
}
