#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int h, w, n;
int dp[1005][1005];

int main() {
	while(cin >> h >> w >> n) {
		if(h == 0 && w == 0 && n == 0) break;

		vector< vector<int> > v(h, vector<int>(w));
		rep(i, h) {
			rep(j, w) {
				cin >> v[i][j];
			}
		}

		memset(dp, 0, sizeof(dp));
		dp[0][0] = n;

		rep(i, h) {
			rep(j, w) {
				int s = dp[i][j] / 2;
				int t = dp[i][j] - s;

				if(v[i][j] % 2 == 1) {
					dp[i][j+1] += t;
					dp[i+1][j] += s;
				} else {
					dp[i+1][j] += t;
					dp[i][j+1] += s;
				}
			}
		}

		int y = 0, x = 0;
		while(y != h && x != w) {
			if(v[y][x] == 1) {
				if(dp[y][x] % 2 == 1) {
					x++;
				} else {
					y++;
				}
			} else {
				if(dp[y][x] % 2 == 1) {
					y++;
				} else {
					x++;
				}
			}
		}

		cout << y + 1 << " " << x + 1 << endl;
		// rep(i, h) {
		// 	rep(j, w) {
		// 		cout << dp[i][j] << " ";
		// 	}
		// 	cout << endl;
		// }
	}

	return 0;
}