1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);
 4 #define LL long long
 5 #define ULL unsigned LL
 6 #define fi first
 7 #define se second
 8 #define pb push_back
 9 #define lson l,m,rt<<1
10 #define rson m+1,r,rt<<1|1
11 #define max3(a,b,c) max(a,max(b,c))
12 #define min3(a,b,c) min(a,min(b,c))
13 typedef pair<int,int> pll;
14 const int INF = 0x3f3f3f3f;
15 const LL mod = 1e9+7;
16 const int N = 1e6+10;
17 vector<int> son[N];
18 int vis[N];
19 int anc[N][21];
20 bool can[N];
21 void dfs(int o,int u){
22     for(int i = 0; i < son[u].size(); i++){
23         int v = son[u][i];
24         if(o == v) continue;
25         anc[v][0] = u;
26         for(int i = 1; i <= 20; i++) anc[v][i] = anc[anc[v][i-1]][i-1];
27         dfs(u,v);
28     }
29 }
30 bool check(int x, int k){
31    for(int i = 20; i >= 0; i--){
32         if((k >> i)&1) x = anc[x][i];
33    }
34    return can[x];
35 }
36 int main(){
37     int n, u, v, k;
38     scanf("%d%d", &n, &k);
39     for(int i = 1; i < n; i++){
40         scanf("%d%d", &u, &v);
41         son[u].pb(v);
42         son[v].pb(u);
43     }
44     for(int i = 0; i <= 20; i++) anc[n][i] = n;
45     dfs(n,n);
46     k = n - k - 1;
47     can[n] = 1;
48     for(int i = n - 1; i >= 1; i--){
49         if(check(i,k)){
50             int t = i;
51             while(!can[t]){
52                 can[t] = 1;
53                 t = anc[t][0];
54                 k--;
55             }
56         }
57     }
58     for(int i = 1; i <= n; i++)
59         if(!can[i]) printf("%d ", i);
60     return 0;
61 }