#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 1e3 + 5;
const ll INF = 2e18;

vector<int> dp[1005][505];
int qtd[1005][505];
int val[MAXN], l[MAXN], r[MAXN], n, m;

void dfs(int node) {
    if (val[node]) {
        for (int i = 0; i <= m; i++) {
            dp[node][i] = {val[node]};
            qtd[node][i] = 0;
        }
        return;
    }
    dfs(l[node]);
    dfs(r[node]);
    for (int i = 0; i <= m; i++) {
        if (!i) {
            dp[node][0] = dp[l[node]][0];
            for (int x : dp[r[node]][0]) dp[node][0].push_back(x);
        }
        else {
            if (dp[l[node]][i] >= dp[r[node]][i - 1]) {
                int use = min(i - 1, qtd[r[node]][i - 1]);
                dp[node][i] = dp[r[node]][use];
                for (int x : dp[l[node]][i - use - 1]) dp[node][i].push_back(x);
                qtd[node][i] = qtd[r[node]][use] + qtd[l[node]][i - use - 1] + 1;
            }
            else {
                int use = min(i, qtd[l[node]][i]);
                dp[node][i] = dp[l[node]][use];
                for (int x : dp[r[node]][i - use]) dp[node][i].push_back(x);
                qtd[node][i] = qtd[l[node]][use] + qtd[r[node]][i - use];
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    int tipo, a, b;
    for (int i = 1; i <= n; i++) {
        cin >> tipo;
        if (tipo == 1) {
            cin >> a >> b;
            l[i] = a;
            r[i] = b;
        }
        else {
            cin >> val[i];
        }
    }
    dfs(1);
    for (int x : dp[1][m]) cout << x << ' ';
    cout << '\n';
    return 0;
}