#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll n,k;
vector<ll> g[100001];
ll cnt=0;
vector<bool> seen;
void dfs(ll x,ll k,string ans){
    ans+=to_string(x)+' ';
    cnt++;
    seen[x]=true;
    if (cnt==k){
        cout<<ans;
        return;
    }
    for (ll edge:g[x]){
        if (!seen[edge]) dfs(edge,k,ans);
    }

}
int main()
{
    cin>>n>>k;
    seen.resize(n+1,false);
    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,"");
    return 0;
}