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

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