#include<bits/stdc++.h>

using lint = int64_t;
using namespace std;
const int inf = 1e9 + 10;

int main(void) {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m;
  cin>>n>>m;
  vector<int>a(n, -1), l(n, -1), r(n, -1);
  for(int i=0;i<n;i++){
    int type;
    cin>>type;
    if(type == 1) cin>>l[i]>>r[i], l[i]--, r[i]--;
    else cin>>a[i];
  }
  vector<vector<int>>dp(n, vector<int>(n+1, inf));
  for(int i=n-1;i>=0;i--){
    if(a[i] != -1){
      for(int j=0;j<=n;j++) dp[i][j] = a[i];
    }
    else{
      dp[i][0] = dp[l[i]][0];
      for(int j=1;j<=n;j++) dp[i][j] = min(dp[l[i]][j], dp[r[i]][j-1]);
    }
  }

  vector<int>ans;
  auto go = [&](auto& self, int v, int k)->int {
    if(l[v] == -1){
      ans.push_back(a[v]);
      return k;
    }
    if(k && dp[l[v]][k] > dp[r[v]][k-1]){
      int c = self(self, r[v], k - 1);
      int d = self(self, l[v], c);
      return d;
    }
    else{
      int c = self(self, l[v], k);
      int d = self(self, r[v], c);
      return d;
    }
  };

  int rest = go(go, 0, m);
  int sz = ans.size();
  if(rest&1) swap(ans[sz-2], ans[sz-1]);
  for(int u : ans) cout<<u<<" ";
  cout<<"\n";

  return 0;
}