#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()

vector<int> operator+(vector<int> a, vector<int> b) {
    for (auto i : b) a.push_back(i);
    return a;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    vector<int> a(n, -1);
    vector<int> l(n, -1), r(n, -1);
    for (int i = 0; i < n; ++i) {
        int t;
        cin >> t;
        if (t == 1) {
            cin >> l[i] >> r[i];
            --l[i], --r[i];
        } else {
            cin >> a[i];
        }
    }
    vector<vector<vector<int>>> dp(n);
    auto dfs = [&](auto dfs, int u) -> void {
        if (a[u] != -1) {
            dp[u] = {{a[u]}};
            return;
        }
        dfs(dfs, l[u]);
        dfs(dfs, r[u]);
        dp[u].resize(dp[l[u]].size() + dp[r[u]].size(), {(int)1e9 + 1});
        for (int i = 0; i < dp[l[u]].size(); ++i) {
            for (int j = 0; j < dp[r[u]].size(); ++j) {
                dp[u][i + j] = min(dp[u][i + j], dp[l[u]][i] + dp[r[u]][j]);
                dp[u][i + j + 1] = min(dp[u][i + j + 1], dp[r[u]][j] + dp[l[u]][i]);
            }
        }
        for (int i = 0; i + 2 < dp[u].size(); ++i) {
            dp[u][i + 2] = min(dp[u][i + 2], dp[u][i]);
        }
        dp[l[u]].clear();
        dp[l[u]].shrink_to_fit();
        dp[r[u]].clear();
        dp[r[u]].shrink_to_fit();
    };
    dfs(dfs, 0);
    for (auto i : dp[0][m]) cout << i << ' ';
}