#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll n,k;
vector<ll> g[100001];
vector<ll> p;
ll cnt=0;
vector<bool> seen;
void dfs(ll x,ll k, ll s){
    cnt++;
    seen[x]=true;
    if (cnt==k){
        int most=x;
        vector<ll> ans;
        while (most!=0){
            ans.push_back(most);
            most=p[most];
        }
        reverse(ans.begin(), ans.end());
        for (ll c:ans) cout<<c<<" ";
        return;
    }
    for (ll edge:g[x]){
        if (!seen[edge]){
            p[edge]=x;
            dfs(edge,k,s);
        }
    }

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    seen.resize(n+1,false);
    p.resize(n+1,0);
    for (ll i=1; i<n;i++){
        ll a,b;
        cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for (ll i=1; i<=n;i++) sort(g[i].begin(), g[i].end());
    k+=n;
    ll z=k/n;
    if (k%n==0){
        z--;
    }
    cnt=(z-1)*n;
    dfs(z,k-n,z);
    return 0;
}