#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e3+5,M=2e3+5,K=63,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,l[N],r[N],A[N];
#define vb vector<basic_string<int> >
vb dfs(int x){
	// cerr<<x<<'\n';
	if(!l[x])return {{A[x]}};
	vb f1=dfs(l[x]),f2=dfs(r[x]),f(f1.size()+f2.size());
	for(int i=0;i<f1.size();i++){
		for(int j=0;j<f2.size();j++){
			if(f[i+j].empty()) f[i+j]=f1[i]+f2[j];
			else f[i+j]=min(f[i+j],f1[i]+f2[j]);
			if(f[i+j+1].empty()) f[i+j+1]=f2[j]+f1[i];
			else f[i+j+1]=min(f[i+j+1],f2[j]+f1[i]);
		}
	}
	return f;
}
int main(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) {
		int op;scanf("%d",&op);
		if(op==1) scanf("%d%d",&l[i],&r[i]);
		else scanf("%d",&A[i]);
	}
	auto p=dfs(1)[m];
	for(int i:p) printf("%d ",i);
}