#include <bits/stdc++.h>
using namespace std;
using ll=long long;

const int maxn=1e5+1;
vector<int> adj[maxn];
int cnt,p[maxn],last;
vector<int> ans;

void dfs(int v, int par) {
    cnt--;
    last=v;
    if(cnt==0)return;
    for(int to:adj[v]) {
        if(to==par)continue;
        p[to]=v;
        dfs(to,v);
    }
}

int main() {
    ll n,k;cin>>n>>k;
    for(int i=1;i<n;i++) {
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for(int i=1;i<=n;i++)sort(adj[i].begin(),adj[i].end());
    int root=(k-1)/n+1;
    cnt=k%n;
    if(!cnt)cnt=n;
    dfs(root,-1);
    while(last){
        ans.push_back(last);
        last=p[last];
    }
    reverse(ans.begin(),ans.end());
    for(int x:ans)cout<<x<<' ';
    cout<<'\n';
}