#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

pair<int, int> solve(int H, int W, int N, vector<vector<int>> f) {

    vector<vector<int>> dp(H + 1, vector<int>(W + 1, 0));
    dp[0][0] = N - 1;
    FOR(y, 0, H) {
        FOR(x, 0, W) {
            int num = dp[y][x];
            if (num % 2 == 0) {
                dp[y + 1][x] += num / 2;
                dp[y][x + 1] += num / 2;
            }
            else {
                if (f[y][x] == 0) {
                    dp[y + 1][x] += num - (num / 2);
                    dp[y][x + 1] += num / 2;
                }
                if (f[y][x] == 1) {
                    dp[y + 1][x] += num / 2;
                    dp[y][x + 1] += num - (num / 2);
                }
            }
        }
    }

    FOR(y, 0, H) {
        FOR(x, 0, W) {
            if (dp[y][x] % 2 != 0) {
                f[y][x] = 1 - f[y][x];
            }
        }
    }

    int y = 0, x = 0;
    while (true) {
        int p = f[y][x];
        if (p == 0) {
            y += 1;
        }
        else {
            x += 1;
        }

        if (y == H or x == W) {
            break;
        }
    }

    return make_pair(y, x);
}

int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

	while (true) {
        int H, W, N;
        cin >> H >> W >> N;
        if (H == 0 and W == 0 and N == 0) {
            break;
        }
        vector<vector<int>> f(H + 1, vector<int>(W + 1));
        FOR(y, 0, H) {
            FOR(x, 0, W) {
                cin >> f[y][x];
            }
        }

        auto ans1 = solve(H, W, N, f);
        cout << ans1.first + 1 << " " << ans1.second + 1 << endl;

    }
	
	return 0;
}


Measured memory_bytes: 14796