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

const int maxn=1000;
int n,m;
int a[maxn+5];
int g[maxn+5][2];
int sz[maxn+5];
int nonleaf[maxn+5];

pair<int,int> dp[maxn+5][maxn/2+5];

int top=0;
int arr[maxn+5];
void getarray(int u,int t){
//	cerr << u << " " << t << " " << top << endl;
	if (sz[u]==0){
		arr[++top]=a[u];
		return;	
	}
	int flip=dp[u][t].second;
	int v=g[u][0];
	int w=g[u][1];
	int vt=dp[u][t].first;
	int wt=t-vt-flip;
	if (!flip){
		getarray(v,vt);
		getarray(w,wt);
	}
	else{
		getarray(w,wt);
		getarray(v,vt);	
	}
}

int nowtop=0;
int nowarr[maxn+5];

void dfs(int u){
	nonleaf[u]=1;
	if (sz[u]==0){
		nonleaf[u]=0;
		dp[u][0]=make_pair(0,0);
		return;
	}
	int v=g[u][0];
	int w=g[u][1];
	dfs(v);
	dfs(w);
	nonleaf[u]+=nonleaf[v];
	nonleaf[u]+=nonleaf[w];
	for (int t=0;t<=nonleaf[u] && t<=m;t++){
		for (int flip=0;flip<=1;flip++){
			for (int vt=0;vt<=nonleaf[v] && vt<=t-flip;vt++){
				int wt=t-flip-vt;
				if (wt>nonleaf[w]) continue;
				if (dp[v][vt].first==-1) continue;
				if (dp[w][wt].first==-1) continue;
				
				if (!flip){
					top=0;
					getarray(v,vt);
					getarray(w,wt);	
				}
				else{
					top=0;
					getarray(w,wt);
					getarray(v,vt);
				}
				if (dp[u][t].first==-1){
					dp[u][t]=make_pair(vt,flip);
					nowtop=top;
					for (int i=1;i<=top;i++) nowarr[i]=arr[i];
				}
				else{
					bool flag=0;
					for (int i=1;i<=top;i++){
						if (arr[i]==nowarr[i]) continue;
						if (arr[i]<nowarr[i]) flag=1;
						break;
					}
					if (flag){
						dp[u][t]=make_pair(vt,flip);
						nowtop=top;
						for (int i=1;i<=top;i++) nowarr[i]=arr[i];	
					}
				}
			}
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	
	cin >> n >> m;
	for (int i=1;i<=n;i++){
		int opt=0;
		cin >> opt;
		if (opt==1){
			int x,y;
			cin >> x >> y;
			sz[i]=2;
			g[i][0]=x;
			g[i][1]=y;
		}
		else{
			cin >> a[i];
			sz[i]=0;	
		}
	}
	/*
	cerr << "---" << endl;
	for (int i=1;i<=n;i++) cerr << sz[i] << " ";
	cerr << endl;
	for (int i=1;i<=n;i++) cerr << g[i][0] << " " << g[i][1] << endl;
	for (int i=1;i<=n;i++) cerr << a[i] << " ";
	cerr << endl;
	cerr << "---" << endl;
	*/
	for (int i=1;i<=n;i++)
		for (int j=0;j<=n;j++) dp[i][j]=make_pair(-1,-1);
		
	dfs(1);
	/*
	for (int i=1;i<=n;i++){
		for (int j=0;j<=2;j++){
			cerr << "(" << dp[i][j].first << "," << dp[i][j].second << ") ";
		}
		cerr << endl;
	}
	*/
	nowtop=n;
	for (int i=1;i<=nowtop;i++) nowarr[i]=n+1;
	
	for (int t=m;t>=0;t-=2){
		if (dp[1][t].first==-1) continue;
	//	cerr << "-------------" << endl;
		top=0;
		getarray(1,t);
		bool flag=0;
		for (int i=1;i<=top;i++){
			if (arr[i]==nowarr[i]) continue;
			if (arr[i]<nowarr[i]) flag=1;
			break;
		}
		if (flag){
			nowtop=top;
			for (int i=1;i<=top;i++) nowarr[i]=arr[i];	
		}	
	}
	for (int i=1;i<=nowtop;i++) cout << nowarr[i] << " \n"[i==nowtop];
	return 0;
}