#include <bits/stdc++.h>
using namespace std;
// 看错题意了，如果有多个仓库均满足该要求，是选取其中编号最小的仓库作为上级仓库，而不是选位置编码最小的仓库
int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> repo(n + 1, vector<int>(m));
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> repo[i][j];
        }
    }

    for (int i = 1; i <= n; ++i) {
        int min_superior = 0;
        for (int j = 1; j <= n; ++j) {
            if (i == j) continue;
            bool valid = true;
            for (int k = 0; k < m; ++k) {
                if (repo[j][k] <= repo[i][k]) {
                    valid = false;
                    break;
                }
            }
            if (valid) {
                if (min_superior == 0 || j < min_superior) {
                    min_superior = j;
                }
            }
        }
        cout << min_superior << endl;
    }
    return 0;
}