#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <stack>
#include <vector>
#include <cmath>
#include <unordered_map>
#include <queue>
#define forn(i,aa,bb) for(int i=aa;i<=bb;++i)
#define LL long long 
using namespace std;
const int N=1e3+5;
const LL mod=998244353;
int n,m;
int a[N];
struct node{
    int l,r;
    node() {
        l=r=0;
    }
}ch[N];
auto dfs(int x) {
    vector< vector<int> > dp;
    if (!ch[x].l && !ch[x].r) {
        dp={{a[x]}};
        return dp;
    }
    auto l=dfs(ch[x].l);
    auto r=dfs(ch[x].r);
    dp.resize(l.size()+r.size());
    forn(i,0,l.size()-1)
        forn(j,0,r.size()-1) {
            if (i+j>m) break;
            auto a=l[i];
            a.insert(a.end(),r[j].begin(),r[j].end());
            if (dp[i+j].empty() || dp[i+j]>a) dp[i+j]=a;
            if (i+j+1>m) break;
            a=r[j];
            a.insert(a.end(),l[i].begin(),l[i].end());
            if (dp[i+j+1].empty() || dp[i+j+1]>a) dp[i+j+1]=a;
        }
    return dp;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    //cin>>T;
    T=1;
    while (T--) {
        cin>>n>>m;
        forn(i,1,n) {
            int ty,x,y;
            cin>>ty;
            if (ty==2) {
                cin>>x;
                a[i]=x;
            }
            else {
                cin>>ch[i].l>>ch[i].r;
            }
        }
        auto f=dfs(1);
        auto ans=f[m];
        for(int i=m;i>=0;i-=2)
            ans=min(ans,f[i]);
        for(int x:ans)
            cout<<x<<' ';
        cout<<'\n';
    }
    
}