#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
typedef long long ll;
using namespace std;
const ll INF = ~(1LL << 63);
ll K;
vector<set<ll>> G;
vector<bool> vis;
unordered_map<ll, ll> DP;
bool rec(ll node, stack<ll> &s) {
    ll origK, key;
    vis[node] = true;
    if(!--K) {
        s.push(node);
        return true;
    }
    for(const auto &x : G[node]) {
        if(vis[x])
            continue;
        key = node | (x << 32);
        auto found = DP.find(key);
        if(found != DP.end() && K > found->second) {
            K -= found->second;
            continue;
        }
        origK = K;
        if(rec(x, s)) {
            s.push(node);
            return true;
        }
        DP[key] = origK - K;
    }
    return false;
}
int main() {
    FastIO;
    ll i, N, n1, n2;
    set<ll> ns;
    cin >> N >> K;
    G.resize(N + 1);
    vis.resize(N + 1);
    for(i = 1; i < N; i++) {
        cin >> n1 >> n2;
        G[n1].insert(n2);
        G[n2].insert(n1);
        ns.insert(n1);
        ns.insert(n2);
    }
    for(auto it = ns.begin(); it != ns.end(); it++) {
        stack<ll> s;
        fill(vis.begin() + 1, vis.end(), false);
        if(rec(*it, s)) {
            while(!s.empty()) {
                cout << s.top() << ' ';
                s.pop();
            }
            cout << '\n';
            return 0;
        }
    }
    return 1;
}