#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
	int n, m, p;
	cin >> n >> m >> p;
    vector <vector<int>> a (n, vector <int> (m));
	vector <int> ans (n, 0);
	vector <int> vec;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			cin >> a[i][j];
	for(int j = 0; j < m; j++)
		{
			for(int i = 0; i < n; i++)
				{
					for (int z = 0; z < vec.size(); z++)
						if (a[i][j] == vec[z])
							ans[i] = j + 1;
					for(int k = i + 1; k < n; k++)
						{
							if(a[i][j] == a[k][j] && ans[i] == 0 && ans[k] == 0 && a[i][j] != 0)
							{
								ans[i] = j + 1;
								ans[k] = j + 1;
								vec.push_back(a[i][j]);
							}
						}
				}
		}
	for (int i = 0; i < n; i++)
		cout << ans[i] << endl;
    return 0;
}