#include<iostream>
#include<map>
using namespace std;
const int maxn = 101;
int a[maxn][maxn];
int main() {
	int i, j, m, n;
	cin >> m >> n;
	//用于存每行最小的数
	map<int, int>map;
	for (i = 0; i < m; i++) {
		for (j = 0; j < n; j++) {
			cin >> a[i][j];
			if (j == 0)
				map[i] = j;
			if (a[i][j] < a[i][map[i]])
				map[i] = j;
		}
	}
	//在每列中比较
	for (i = 0; i < m; i++) {
		int temp = map[i];
		int temp1 = a[i][map[i]];
		for (j = 0; j < m; j++) {
			if (a[j][temp] > temp1)
				break;
			if (j == m - 1)
				cout << i << " " << temp << " " << temp1 << endl;
		}
	}
	return 0;
}