#include<cstdio>
#include<iostream>
#include<vector>
#define RI register int
#define CI const int&
using namespace std;
const int N=1005,INF=1e9+5;
int n,m,tp,l[N],r[N],a[N],sz[N]; vector <int> f[N][N/2];
inline void DFS(CI now=1)
{
    if (a[now])
    {
        f[now][0]={a[now]}; f[now][1]={INF};
        return;
    }
    int ls=l[now],rs=r[now]; sz[now]=1;
    DFS(ls); DFS(rs); sz[now]+=sz[ls]+sz[rs];
    for (RI i=0;i<=min(m,sz[now]);++i) f[now][i]={INF};
    auto merge=[&](vector <int>& A,vector <int>& B)
    {
        vector <int> vec=A;
        for (auto& x:B) vec.push_back(x);
        return vec;
    };
    for (RI p=0;p<=min(m,sz[ls]);++p)
    for (RI q=0;q<=min(m-q,sz[rs]);++q)
    {
        f[now][p+q]=min(f[now][p+q],merge(f[ls][p],f[rs][q]));
        if (p+q+1<=m) f[now][p+q+1]=min(f[now][p+q+1],merge(f[rs][q],f[ls][p]));
    }
    for (RI i=0;i<=min(m,sz[ls]);++i) f[ls][i].shrink_to_fit();
    for (RI i=0;i<=min(m,sz[ls]);++i) f[rs][i].shrink_to_fit();
}
int main()
{
    scanf("%d%d",&n,&m);
    for (RI i=1;i<=n;++i)
    {
        scanf("%d",&tp);
        if (tp==1) scanf("%d%d",&l[i],&r[i]);
        else scanf("%d",&a[i]);
    }
    DFS(); vector <int> ans={INF};
    //for (RI i=m;i>=0;i-=2) ans=min(ans,f[1][i]);
	 ans=min(ans,f[1][m]);
    for (auto x:ans) printf("%d ",x);
    return 0;
}