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

int main() {
	int n, m, k, inp, len; cin >> n >> m >> k;
	vector<pair<int, int>> move = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
	queue<pair<int, int>> kell;
	vector<vector<int>> visited(n, vector<int>(m));
	
	for (int y = 0; y < n; y++) {
		for (int x = 0; x < m; x++) {
			cin >> inp;
			visited[y][x] = inp;
			if (inp != 0) {
				kell.push({y, x});
			}
		}
	}
	bool vege = false;
	int out1 = 0, out2 = 0;
	while (!kell.empty() && !vege) {
		len = kell.size();
		for (int i = 0; i < len; i++) {
			pair<int, int> csucs = kell.front();
			kell.pop();
			for (pair<int, int> mov : move) {
				if ((csucs.first - mov.first) < 0 || (csucs.first - mov.first) >= n) {
					continue;
				}
				if ((csucs.second - mov.second) < 0 || (csucs.second - mov.second) >= m) {
					continue;
				}
				if (visited[(csucs.first - mov.first)][(csucs.second - mov.second)]) {
					if (visited[(csucs.first - mov.first)][(csucs.second - mov.second)] == visited[csucs.first][csucs.second]) {
						continue;
					}
					out1 = visited[(csucs.first - mov.first)][(csucs.second - mov.second)];
					out2 = visited[csucs.first][csucs.second];
					vege = true;
				}
				visited[(csucs.first - mov.first)][(csucs.second - mov.second)] = visited[csucs.first][csucs.second];
				kell.push({(csucs.first - mov.first), (csucs.second - mov.second)});
			}
				 
		}
	}
	cout << out1 << " " << out2;
}