#include <iostream>
#include <random>

using namespace std;

const int kMaxN = 5001;
int n, a[kMaxN][kMaxN], p[kMaxN];
bool b[kMaxN];

void Input() {
  int seed;
  cin >> n >> seed;
  if (seed) {
    mt19937 Rand(seed);
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        swap(a[i][j] = j, a[i][Rand() % (j + 1)]);
      }
    }
  } else {
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        cin >> a[i][j], a[i][j]--;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    static int b[kMaxN];
    for (int j = 0; j <= n; j++) {
      b[a[i][j]] = j;
    }
    for (int j = 0; j <= n; j++) {
      a[i][j] = b[j];
    }
  }
}

void Calc() {
  for (int i = 1; i <= n; i++) {
    int x = i;
    p[i] = 0;
    for (int j = 0; j <= n; j++) {
      b[j] = 0;
    }
    for (int j = 1; j <= n; j++) {
      x = x == 1 ? n : x - 1;
      for (int &k = p[x]; b[a[x][k]]; k++) {
      }
      b[a[x][p[x]]] = 1;
    }
    for (int j = 0; j <= n; j++) {
      if (!b[j]) {
        cout << j + 1 << " \n"[i == n];
        break;
      }
    }
  }
}

int main() {
  cin.tie(0), cout.tie(0);
  ios::sync_with_stdio(0);
  Input(), Calc();
  return 0;
}