1

#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[105][105];
int x[105], y[105];

int main() {
	n=5;
    m=5;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	memset(x, 0, sizeof(x));
	for (int j = 1; j <= m; j++) {
		y[j] = 1e9;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (x[i] < a[i][j]) {
				x[i] = a[i][j];
			}
		}
	}
	for (int j = 1; j <= m; j++) {
		for (int i = 1; i <= n; i++) {
			if (a[i][j] < y[j]) {
				y[j] = a[i][j];
			}
		}
	}
	bool flag = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (x[i] == y[j]) {
				flag = 1;
				cout << i << " " << j << " " << x[i] << endl;
				return 0;
			}
		}
	}
	if (!flag) {
		cout << "not found";
	}

	return 0;
}