#include<bits/stdc++.h>

using namespace std;

int const maxn = 1005;
int m, a[maxn], sz[maxn], lf[maxn];
vector < int > g[maxn];
vector < int > dp[maxn][maxn / 2];

void dfs(int v) {
    sz[v] = 1;
    lf[v] = 0;
    for (auto u : g[v]) {
        dfs(u);
        sz[v] += sz[u];
        lf[v] += lf[u];
    }
    if (sz[v] == 1) {
        dp[v][0] = {a[v]};
        lf[v] = 1;
        return;
    }
    int l = g[v][0], r = g[v][1];
    for (int i = 0; i <= (sz[l] - 1) / 2; i++) {
        for (int j = 0; j <= (sz[r] - 1) / 2 && i + j <= m; j++) {
            int flag = 1;
            if (dp[v][i + j].empty()) {
                dp[v][i + j] = dp[l][i];
                for (auto key : dp[r][j]) dp[v][i + j].push_back(key);
            } else {
                for (int pos = 0; pos < dp[v][i + j].size(); pos++) {
                    int cur_value;
                    if (pos < lf[l]) cur_value = dp[l][i][pos];
                    else cur_value = dp[r][j][pos - lf[l]];
                    if (cur_value > dp[v][i + j][pos]) break;
                    if (cur_value < dp[v][i + j][pos]) {
                        for (int tmp = pos; tmp < dp[v][i + j].size(); tmp++) {
                            if (tmp < lf[l]) cur_value = dp[l][i][tmp];
                            else cur_value = dp[r][j][tmp - lf[l]];
                            dp[v][i + j][tmp] = cur_value;
                        }
                        break;
                    }
                }
            }
        }
    }
    swap(l, r);
    for (int i = 0; i <= (sz[l] - 1) / 2; i++) {
        for (int j = 0; j <= (sz[r] - 1) / 2 && i + j < m; j++) {
            int flag = 1;
            if (dp[v][i + j + 1].empty()) {
                dp[v][i + j + 1] = dp[l][i];
                for (auto key : dp[r][j]) dp[v][i + j + 1].push_back(key);
            } else {
                for (int pos = 0; pos < dp[v][i + j + 1].size(); pos++) {
                    int cur_value;
                    if (pos < lf[l]) cur_value = dp[l][i][pos];
                    else cur_value = dp[r][j][pos - lf[l]];
                    if (cur_value > dp[v][i + j + 1][pos]) break;
                    if (cur_value < dp[v][i + j + 1][pos]) {
                        for (int tmp = pos; tmp < dp[v][i + j + 1].size(); tmp++) {
                            if (tmp < lf[l]) cur_value = dp[l][i][tmp];
                            else cur_value = dp[r][j][tmp - lf[l]];
                            dp[v][i + j + 1][tmp] = cur_value;
                        }
                        break;
                    }
                }
            }
        }
    }
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, type, l, r;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> type;
        if (type == 1) {
            cin >> l >> r;
            g[i].push_back(l);
            g[i].push_back(r);
        } else cin >> a[i];
    }
    dfs(1);
    vector < int > ans = dp[1][0];
    for (int i = m % 2; i <= m; i += 2) ans = min(ans, dp[1][i]);
    for (auto key : ans) cout << key << " ";
    return 0;
}