#include <bits/stdc++.h>
#define N 25
using namespace std;

int n, m, a[N][N], ans[N]; 
vector<int> vec[N]; 

void solve(int u) {
	for(int i = 1; i <= m; i++) vec[i].clear(); 
	for(int i = 1; i <= n; i++) {
		if(i == u) continue; 
		for(int j = 1; j <= m; j++) {
			if(a[u][j] == a[i][j]) {
				vec[j].push_back(i); 
			}
		}
	}
    int ans = 0; 
	for(int i = 1; i <= m; i++) {
		if((int)vec[i].size() == 0) {
			printf("1 "); 
			return; 
		}
        for(int j = i + 1; j <= m; j++) {
            if(ans == 2) break; 
            bool ok = 1; 
            for(auto v : vec[j]){
                if(!ok) break; 
                if(binary_search(vec[i].begin(), vec[i].end(), v)) {
                    ok = 0;
                    break; 
                }
            }
            if(ok) ans = 2; 
        }
    }
    if(ans == 2) printf("2 "); 
	else printf("3 "); 
	return; 
}

int main(){
	scanf("%d %d", &n, &m); 
	if(n == 1) {
		return !printf("0 "); 
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			scanf("%d", &a[i][j]); 
		}
	} 
	for(int i = 1; i <= n; i++) {
		for(int j = i + 1; j <= n; j++) {
			bool fl = 1; 
			for(int k = 1; k <= m; k++) {
				if(a[i][k] != a[j][k]) {
					fl = 0; 
					break; 
				}
			}
			if(fl) ans[i] = ans[j] = -1; 
		}
	}
	for(int i = 1; i <= n; i++) {
		if(ans[i] == -1) {
			printf("-1 "); 
			continue; 
		} 
		solve(i); 
	}
	return 0;
}

错误信息：答案为1，user输出3

想知道还有什么情况输出1 qwq