#include <bits/stdc++.h>

template<class t> using vc = std::vector<t>;

using namespace std;
typedef long long ll;

const int N = 1005;

int a[N];
int l[N], r[N];

vc<vc<int>> dp[N];

vc<int> merge(vc<int> &a, vc<int> &b) {
    vc<int> ans;
    ans.insert(ans.end(), a.begin(), a.end());
    ans.insert(ans.end(), b.begin(), b.end());
    ans.shrink_to_fit();
    return ans;
}

void dfs(int v) {
    if (!l[v]) return void(dp[v] = {{a[v]}});
    dfs(l[v]), dfs(r[v]);
    dp[v].resize(dp[l[v]].size() + dp[r[v]].size() + 1, {(int) 1e9});
    for (int d1 = 0; d1 < dp[l[v]].size(); ++d1) {
        for (int d2 = 0; d2 < dp[r[v]].size(); ++d2) {
            dp[v][d1 + d2] = min(dp[v][d1 + d2], merge(dp[l[v]][d1], dp[r[v]][d2]));
            dp[v][d1 + d2 + 1] = min(dp[v][d1 + d2 + 1], merge(dp[r[v]][d2], dp[l[v]][d1]));
        }
    }
}

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    for (int i = 1, t; i <= n && cin >> t; ++i) {
        if (t == 1) cin >> l[i] >> r[i];
        else cin >> a[i];
    }
    dfs(1);
    for (auto i : dp[1][m]) cout << i << ' ';
    cout << '\n';
}