#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll n, k;
	cin >> n >> k;
	vector<vector<int>> g(n + 1);
	for (int i = 0; i < n - 1; i++) {
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	for (int i = 1; i <= n; i++) {
		sort(g[i].begin(), g[i].end());
	}
	vector<int> v(n + 1, 0);
	vector<int> u(n + 1, 0);
	vector<int> p;
	vector<int> q;
	p.reserve(n);
	q.push_back(1);
	u[1] = -1;
	while (!q.empty()) {
		int x = q.back();
		q.pop_back();
		p.push_back(x);
		for (int y : g[x]) {
			if (u[y] == 0) {
				u[y] = x;
				q.push_back(y);
			}
		}
	}
	for (int i = n - 1; i >= 0; i--) {
		int x = p[i];
		v[x] = 1;
		for (int y : g[x]) {
			if (y != u[x]) {
				v[x] = v[x] + v[y];
			}
		}
	}
	ll a = (k - 1) / n + 1;
	ll b = (k - 1) % n + 1;
	int x = a;
	int z = -1;
	cout << x;
	while (b > 1) {
		b--;
		int f = 0;
		for (int y : g[x]) {
			if (y == z) {
				continue;
			}
			ll c;
			if (y == u[x]) {
				c = n - v[x];
			} else {
				c = v[y];
			}
			if (b <= c) {
				z = x;
				x = y;
				cout << ' ';
				cout << x;
				f = 1;
				break;
			}
			b = b - c;
		}
		if (f == 0) {
			break;
		}
	}
	cout << '\n';
	return 0;
}