def find_saddle_point(matrix): # 寻找每行的最大值和索引 max_in_rows = [max(row) for row in matrix] # 寻找每列的最小值和索引 min_in_cols = [min(col) for col in zip(*matrix)] # 遍历每行和每列，寻找鞍点 for i in range(5): for j in range(5): if matrix[i][j] == max_in_rows[i] and matrix[i][j] == min_in_cols[j]: return i+1, j+1, matrix[i][j] # 行号和列号从1开始计数 return "not found" # 读取输入的矩阵 matrix = [] for _ in range(5): row = list(map(int, input().split())) matrix.append(row) # 寻找鞍点 result = find_saddle_point(matrix) # 输出结果 if result == "not found": print(result) else: print(" ".join(map(str, result)))