#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using VI = vector<int>;
using VLL = vector<long long>;
using VULL = vector<unsigned long long>;
using VS = vector<string>;
using VB = vector<bool>;
using VC = vector<char>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
using VPII = vector<pair<int, int>>;
using VPLL = vector<pair<long long, long long>>;
using VPULL = vector<pair<unsigned long long, unsigned long long>>;
using VVI = vector<vector<int>>;
using VVLL = vector<vector<long long>>;
using MII = map<int, int>;
using MLL = map<long long, long long>;
using SLL = set<long long>;
using SI = set<int>;
using PQI = priority_queue<int>;
template <class T>
T maxT(T a, T b) {
  return (a > b ? a : b);
}
template <class T>
T minT(T a, T b) {
  return (a < b ? a : b);
}
template <class T>
void setmax(T &a, T b) {
  a = (a > b ? a : b);
}
template <class T>
void setmin(T &a, T b) {
  a = (a < b ? a : b);
}
void fileio() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("debug.txt", "w", stderr);
}
void ofileio() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
void clock_out() {
  cerr << "\nTime Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << H;
  debug_out(T...);
}
template <typename... Args>
void readln(Args &...args) {
  ((cin >> args), ...);
}
template <typename... Args>
void writeln(Args... args) {
  ((cout << args << " "), ...);
}
const LL MOD = 1000000007;
const LL SIZE = 100000;
const int INF = 0x3f3f3f3f;
const LL LL_INF = 0x3f3f3f3f3f3f3f3f;
const LD PI = acos(-1);
const LL MAXN = numeric_limits<LL>::max();
void solve() {
  int n, m, k;
  readln(n, m, k);
  int arr[n + 1][m + 1];
  for (LL i = (LL)1; i < (LL)n + 1; i++) {
    for (LL j = (LL)1; j < (LL)m + 1; j++) {
      cin >> arr[i][j];
    }
  }
  VI lst(n + 1, -1);
  map<int, pair<int, int>> mp;
  VI mem(k + 1, 0);
  for (LL i = (LL)1; i < (LL)m + 1; i++) {
    for (LL j = (LL)1; j < (LL)n + 1; j++) {
      if (arr[j][i] == 0) continue;
      1;
      if (lst[j] != -1)
        continue;
      else {
        if (mp.count(arr[j][i])) {
          1;
          int cycle = mp[arr[j][i]].second;
          if (cycle == i) {
            lst[mp[arr[j][i]].first] = i;
            lst[j] = i;
            mem[arr[j][i]] = 1;
          } else if (mem[arr[j][i]] == 1) {
            lst[j] = i;
          } else {
            mp[arr[j][i]] = {j, i};
          }
        } else {
          mp[arr[j][i]] = {j, i};
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (lst[i] == -1)
      cout << 0 << "\n";
    else
      cout << lst[i] << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  srand(time(NULL));
  1;
  LL t = 1;
  while (t--) {
    solve();
  }
  1;
  return 0;
}
