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

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 5e3 + 5;

int atrc[nmax][nmax];

int rez[nmax];

void gen(int n, int seed) {
   if(seed != 0) {
      std::mt19937 rnd(seed);
      for(int i = 1; i <= n; ++i) {
         for(int j = 1; j <= n + 1; ++j) {
            atrc[i][j] = j;
            swap(atrc[i][j], atrc[i][rnd() % j + 1]);
         }
      }
   }
   else {
      for(int i = 1; i <= n; i++)
         for(int j = 1; j <= n + 1; j++)
            cin >> atrc[i][j];
   }
   return;
}

queue<int> Bbypoz[nmax];
vector<int> occ;

int atrkill[nmax];

int n;
void addLine(int T) {
   int mn = -1;
   for(int i = 1; i <= n + 1; i++) {
      if(occ[i] == 1) continue;
      if(mn == -1) mn = i;
      else if(atrc[T][i] < atrc[T][mn]) mn = i;
   }
   
   atrkill[T] = mn;
   occ[mn] = 1;
   for(int i = 1; i <= n + 1; i++)
      Bbypoz[i].emplace(T);
   return;
}

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int seed;
   cin >> n >> seed;
   gen(n, seed);
   
   occ = vector<int>(n + 2, 0);
   
   for(int i = n; i > 0; i--) addLine(i);
   for(int i = 1; i <= n + 1; i++) if(occ[i] == 0) rez[1] = i;
   
   auto get_value = [&](int value) {
      while(!Bbypoz[value].empty()) {
         int L = Bbypoz[value].front();
         if(atrc[L][atrkill[L]] >= atrc[L][value]) return L;
         Bbypoz[value].pop();
      }
      return -1;
   };
   
   for(int p = n; p > 1; p--) { // putem sa nu ne prostim si sa inseram linia la final
      //cerr << "Ans for " << p << ":\n";
      //for(int i = p, timer = 0; timer < n; p = (p == 1? n : p - 1), timer++) cerr << p << ": " << atrkill[p] << '\n';
      //cerr << "---\n";
      int L = p, value = atrkill[L];
      get_value(value);
      Bbypoz[value].pop();
      occ[value] = 0;
      
      while((L = get_value(value)) != -1) {
         //cerr << "moving " << value << " to " << L << '\n';
         L = Bbypoz[value].front();
         occ[value] = 1;
         swap(atrkill[L], value);
         
         occ[value] = 0;
         Bbypoz[value].pop();
      }
      
      addLine(p);
      for(int i = 1; i <= n + 1; i++) if(occ[i] == 0) rez[p] = i;
   }
   
   for(int i = 1; i <= n; i++) cout << rez[i] << ' ';
   cout << '\n';
}

/**
 * AXAXAXAXAXAXAXAXA NU TE CRED
 * Adica, are sens, pt ca gen, orice chestie de jos sigur va muri ca rezultat al unei asemenea actiuni
 * dar what the fuck man AXAXAXAXAAXAXAAXAXAXA
*/