#include<bits/stdc++.h>
using namespace std;

//#define ONLINE
#ifndef ONLINE
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

template<typename T>
inline T READ(){
	T x=0; bool f=0; char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=x*10+c-'0',c=getchar();
	return f?-x:x;
}
inline int read(){return READ<int>();}
inline LL readLL(){return READ<LL>();}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int main(){
	int n=read(),m=read();
	vector<array<int,2>>son(n+1,{0,0});
	vector<int>a(n+1,0);
	for(int i=1;i<=n;i++){
		if(read()==1){
			son[i][0]=read();
			son[i][1]=read();
		}
		else{
			a[i]=read();
		}
	}
	auto dfs=[&](auto self,int u)->vector<vector<int>>{
		if(a[u]){
			return {{a[u]}};
		}
		auto L=self(self,son[u][0]),R=self(self,son[u][1]);
		vector<vector<int>>dp(min( int(L.size()+R.size()+1), m+1 ));
		for(int i=0;i<L.size();i++){
			for(int j=0;i+j<=m && j<R.size();j++){
				auto tmp=L[i];
				tmp.insert(tmp.end(),R[j].begin(),R[j].end());
				if(dp[i+j].empty() || tmp<dp[i+j]){
					dp[i+j]=tmp;
				}
				if(i+j+1>m) continue;
				tmp=R[j];
				tmp.insert(tmp.end(),L[i].begin(),L[i].end());
				if(dp[i+j+1].empty() || tmp<dp[i+j+1]){
					dp[i+j+1]=tmp;
				}
			}
		}
		return dp;
	};
	auto dp=dfs(dfs,1);
	auto ans=dp[m];
	for(int i=m-2;i>=0;i-=2){
		ans=min(ans,dp[i]);
	}
	for(int x:ans) printf("%d ",x);
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/