#include <bits/stdc++.h>
#define endl '\n'
#define alls(x) x.begin(),x.end()
using namespace std;
using i64 = long long;
using PII = pair<int, int>;
const int g = 3, mod = 1e9 + 7, INF = 0x3f3f3f3f;
const int N = 510, M = 1010;

int n, m;
int val[M], sz[M];
PII son[M];

vector<int> dp[M][M];

void add(vector<int>& a, vector<int>& b, vector<int>& c){
    c = a;
    for(int i : b) c.emplace_back(i);
}

inline bool check(vector<int>& a, vector<int>& b){
    int sz1 = a.size(), sz2 = b.size();
    int mnsz = min(sz1, sz2);
    for(int i = 0; i < mnsz; ++ i){
        if(a[i] < b[i]) return true;
        else if(a[i] > b[i]) return false;
    }
    return sz1 < sz2;
}

void dfs(int u){
    sz[u] = 1;
    int lroot = son[u].first, rroot = son[u].second;
    if(lroot != rroot){
        //递归计算左右儿子
        dfs(lroot);
        dfs(rroot);
        sz[u] += sz[lroot];
        sz[u] += sz[rroot];
        vector<int> res;
        //计算当前点, 不交换
        for(int i = 0; i <= sz[lroot] / 2; ++ i){//左儿子用i次
            for(int j = 0; j <= sz[rroot] / 2; ++ j){//右儿子j次
                res.clear();
//                add(dp[lroot][i], dp[rroot][j], res);
                res.insert(res.end(), alls(dp[lroot][i]));
                res.insert(res.end(), alls(dp[rroot][j]));
                if(dp[u][i + j].empty()) dp[u][i + j] = res;
                else if(res < dp[u][i + j]) dp[u][i + j] = res;
            }
        }

        //交换
        for(int i = 0; i <= sz[lroot] / 2; ++ i){//左儿子用i次
            for(int j = 0; j <= sz[rroot] / 2; ++ j){//右儿子j次
                res.clear();
                res.insert(res.end(), alls(dp[rroot][j]));
                res.insert(res.end(), alls(dp[lroot][i]));
                if(dp[u][i + j + 1].empty()) dp[u][i + j + 1] = res;
                else if(res < dp[u][i + j + 1]) dp[u][i + j + 1] = res;
            }
        }
    }
    else{//叶节点，无论怎么变化都一样的
        for(int i = 0; i <= m; ++ i)
            dp[u][i].emplace_back(val[u]);
    }
}

void solve() {
    cin >> n >> m;
    for(int i = 1; i <= n; ++ i)
        for(int j = 0; j <= m; ++ j)
            dp[i][j] = vector<int>();
    int op, l, r;
    for(int i = 1; i <= n; ++ i){
        cin >> op;
        if(op == 1){
            cin >> l >> r;
            son[i] = {l, r};
        }
        else {
            cin >> l;//叶节点
            val[i] = l;
        }
    }
    if(n == 1){
        cout << val[1] << endl;
        return;
    }
    dfs(1);
    vector<int> ans = dp[1][m];
    //两次操作可以重复，这样就能抵消掉他们
    for(int i = m; i >= 0; i -= 2)
        if(dp[1][i] < ans) ans = dp[1][i];

    for(int j : ans)
        cout << j << ' ';
    cout << endl;
}

signed main() {
#ifdef ONLINE_JUDGE
#else
    freopen("902.in", "r", stdin);
    freopen("902.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
        solve();
    }
    return 0;
}