#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int oo = 1e9 + 7;
const int base = 1e9 + 7;
vector<vector<int>> tree(407);
vector<vector<int>> f(407, vector<int>(407, oo));
int dd[407][407];
int parent[407];
int d[401][401][401];
int n, k;
void pre(int u, int par) {
  f[u][0] = 1;
  f[u][1] = 0;
  parent[u] = par;
  for (int i = 0; i < tree[u].size(); ++i)
    if (tree[u][i] != par) {
      int v = tree[u][i];
      pre(v, u);
      for (int k = n; k; k--) {
        {
          int tmp = oo;
          for (int b = 0; b < k; ++b) {
            int a = k - b;
            if (tmp > f[u][a] + f[v][b])
              tmp = f[u][a] + f[v][b], d[u][k][i] = b;
          }
          f[u][k] = tmp;
        }
      }
    }
}
void dfs(int u, int papa, int si) {
  for (int i = tree[u].size() - 1; i >= 0; i--) {
    if (tree[u][i] != papa) {
      int v = tree[u][i];
      if (d[u][si][i]) {
        dfs(v, u, d[u][si][i]);
      } else {
        cout << dd[u][v] << " ";
      }
      si -= d[u][si][i];
    }
  }
}
int main() {
  if (fopen("berland.inp", "r"))
    freopen("berland.inp", "r", stdin), freopen("berland.out", "w", stdout);
  scanf("%d%d", &n, &k);
  int u, v;
  for (int i = 1; i < n; ++i)
    scanf("%d%d", &u, &v), tree[u].push_back(v), tree[v].push_back(u),
        dd[u][v] = i, dd[v][u] = i;
  pre(1, 0);
  int ans = f[1][k], best = 1;
  for (int i = 2; i <= n; ++i)
    if (ans > f[i][k] + 1) {
      ans = f[i][k] + 1;
      best = i;
    }
  cout << ans << endl;
  if (ans) {
    if (best != 1) cout << dd[best][parent[best]] << " ";
    dfs(best, parent[best], k);
  }
}
