#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define ull unsigned ll
#define i128 __int128
using namespace std;
namespace qiqi {
	void main() {
		int n,m;
		cin >> n >> m;
		vi a(n); vector<array<int,2>> ch(n,{-1,-1});
		for (int i = 0; i < n; i++) {
			int c; cin >> c;
			if (c == 1) {
				for (int j = 0; j < 2; j++) {
					cin >> ch[i][j]; ch[i][j]--;
				}
			}
			else {
				cin >> a[i];
			}
		}
		auto dfs = [&](auto self,int u) -> vector<vi> {
			vector<vi> vec(m+1);
			if (ch[u] == array<int,2>{-1,-1}) {
				for (int i = 0; i <= m; i += 2) {
					vec[i] = vi({a[u]});
				}
			}
			else {
				vector<vi> v[2];
				for (int i = 0; i < 2; i++) {
					v[i] = self(self,ch[u][i]);
				}
				for (int j = 0; j < 2; j++) {
					for (int k = 0,p = 0; k < 2; k++,p++) {
						for (int i = k; i+j <= m; i++) {
							if (!v[j][p].empty() && !v[j^1][i-p].empty()) {
								int cur = (i-k)/2*2+k;
								if (v[j][cur] < v[j][p]) {
									p = cur;
								}
								vi tmp = v[j][p];
								for (auto x:v[j^1][i-p]) {
									tmp.eb(x);
								}
								if (vec[i+j].empty()) {
									vec[i+j] = tmp;
								}
								else {
									vec[i+j] = min(vec[i+j],tmp);
								}
							}
						}
					}
				}
			}
			return vec;
		};
		auto vec = dfs(dfs,0)[m];
		for (auto x:vec) {
			cout << x << ' ';
		}
		cout << '\n';
	}
}
int main() {
//	clock_t st = clock();
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	qiqi::main();
//	cout << (double)(clock()-st)/CLOCKS_PER_SEC;
	return 0;
}