#include <bits/stdc++.h> using namespace std; int main(){ int a[5][5]; for (int i=0;i<5;i++){ for (int j=0;j<5;j++){ cin>>a[i][j]; } }

for(int i=0;i<5;i++){
    for (int j=0;j<5;j++){
        if(a[i][j]==max({a[i][0],a[i][1],a[i][2],a[i][3],a[i][4]}) && a[i][j]==min({a[0][j],a[1][j],a[2][j],a[3][j],a[4][j]})){
            
            cout<<i+1<<" "<<j+1<<" "<<a[i][j];
            return 0;
            
        }
    }
}

cout<<"not found";

return 0;

}

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

const int N = 15; // 根据题目条件，5x5矩阵，所以N=15足够 int matrix[N][N]; int row_max[N]; // 存储每行的最大值 int col_min[N] = {INT_MAX,INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX}; // 存储每列的最小值

int main() {

// 读取矩阵元素
for (int i = 1; i <= 5; ++i) {
    for (int j = 1; j <= 5; ++j) {
        cin >> matrix[i][j];
        // 更新每行的最大值
        row_max[i] = max(row_max[i], matrix[i][j]);
        // 更新每列的最小值
        col_min[j] = min(col_min[j], matrix[i][j]);
    }
}

// 寻找鞍点
bool found = false;
for (int i = 1; i <= 5; ++i) {
    for (int j = 1; j <= 5; ++j) {
        if (matrix[i][j] == row_max[i] && matrix[i][j] == col_min[j]) {
            cout << i << " " << j << " " << matrix[i][j] << endl;
            found = true;
            break;
        }
    }
    if (found) break;
}

if (!found) {
    cout << "not found" << endl;
}

return 0;

}