The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.

The nation has n districts numbered from 1 to n, each district has exactly one path connecting it to every other district. The number of fans of a contestant from district i is equal to 2^i.

This year, the president decided to reduce the costs. He wants to remove k contestants from the games. However, the districts of the removed contestants will be furious and will not allow anyone to cross through their districts. 

The president wants to ensure that all remaining contestants are from districts that can be reached from one another. He also wishes to maximize the total number of fans of the participating contestants.

Which contestants should the president remove?

Input

The first line of input contains two integers n and k (1 ≤ k < n ≤ 10^6) — the number of districts in Panel, and the number of contestants the president wishes to remove, respectively.

The next n-1 lines each contains two integers a and b (1 ≤ a, b ≤ n, a ≠ b), that describe a road that connects two different districts a and b in the nation. It is guaranteed that there is exactly one path between every two districts.

Output

Print k space-separated integers: the numbers of the districts of which the contestants should be removed, in increasing order of district number.

Examples

Input

6 3
2 1
2 6
4 2
5 6
2 3


Output

1 3 4


Input

8 4
2 6
2 7
7 8
1 2
3 1
2 4
7 5


Output

1 3 4 5

Note

In the first sample, the maximum possible total number of fans is 2^2 + 2^5 + 2^6 = 100. We can achieve it by removing the contestants of the districts 1, 3, and 4.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, m;
int p[N], s[N], d[N], sz[N], pos[N], used[N];
vector<int> order;
vector<int> nei[N];
int query(int x) {
  int ans = 0;
  while (x > 0) {
    ans += s[x];
    x -= x & -x;
  }
  return ans;
}
void modify(int x, int v) {
  while (x <= n) {
    s[x] += v;
    x += x & -x;
  }
}
void dfs(int x) {
  order.push_back(x);
  pos[x] = order.size() - 1;
  for (int i = 0; i < nei[x].size(); i++) {
    int to = nei[x][i];
    if (to != p[x]) {
      p[to] = x;
      d[to] = d[x] + 1;
      dfs(to);
      sz[x] += sz[to];
    }
  }
  sz[x]++;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    nei[x].push_back(y);
    nei[y].push_back(x);
  }
  d[n] = 1;
  dfs(n);
  int pre = 0;
  for (int i = 0; i < order.size(); i++) {
    int now = d[order[i]];
    modify(i + 1, now - pre);
    pre = now;
  }
  int cur = n;
  m = n - m;
  while (m) {
    while (query(pos[cur] + 1) > m) {
      cur--;
    }
    int ncur = cur;
    while (!used[ncur] && ncur) {
      used[ncur] = 1;
      modify(pos[ncur] + 1, -1);
      modify(pos[ncur] + sz[ncur] + 1, 1);
      ncur = p[ncur];
      m--;
    }
    cur--;
  }
  for (int i = 1; i <= n; i++)
    if (!used[i]) printf("%d ", i);
  puts("");
  return 0;
}
