#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#define fir first
#define sec second
#define mpr make_pair

#define vv vector
#define eb emplace_back

#define Fr(i, l, r) for (ll i = l; i <= r; ++i)
#define Rf(i, r, l) for (ll i = r; i >= l; --i)

template<typename T> int Max(T& x, T y) { return y > x ? (x = y, 2) : x == y; }
template<typename T> int Min(T& x, T y) { return y < x ? (x = y, 2) : x == y; }

template<typename T> void Read(T& x) {
	x = 0; char ch = getchar(); bool f = false;
	while (!isdigit(ch)) f = f || ch == '-', ch = getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	if (f) x = -x;
}

template<typename T> void Write(T x, char ch = '\n') {
	static int tp, sk[70];
	if (x < 0) putchar('-'), x = -x;
	do { sk[++tp] = x % 10, x /= 10; } while (x);
	while (tp) putchar('0' + sk[tp--]);
	putchar(ch);
}

ll n, m;
ll ls[1010], rs[1010], a[1010];

void Add(vv<ll>& L, vv<ll> R) {
	for (auto i : R) L.eb(i);
}

pair<vv<ll>, ll> F(ll x, ll y) {
	if (ls[x] == 0) return mpr(vv<ll>(1, a[x]), 0);
	auto L = F(ls[x], y);
	auto r = F(rs[x], y - L.sec);
	Add(L.fir, r.fir), L.sec += r.sec;
	if (y == 0) return L;
	auto R = F(rs[x], y - 1);
	auto l = F(ls[x], y - 1 - R.sec);
	Add(R.fir, l.fir), R.sec += l.sec + 1;
	if (L.fir < R.fir) {
		return L;
	} else if (L.fir > R.fir) {
		return R;
	} else {
		if (L.sec < R.sec) return L;
		else return R;
	}
}

int main() {
	Read(n), Read(m);
	Fr (i, 1, n) {
		ll type; Read(type);
		if (type == 1) Read(ls[i]), Read(rs[i]);
		else Read(a[i]);
	}
	auto ans = F(1, m);
	ll len = (n + 1) / 2;
	Fr (i, 1, len) Write(ans.fir[i - 1], " \n"[i == len]);
	return 0;
}