#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;

    int W;
    cin >> W;

    char mat[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }

    int di[] = {-1, 1, 0, 0};
    int dj[] = {0, 0, -1, 1};

    int result = 0;
    int ri, rj;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(mat[i][j] == '.') {
                int si = i;
                int sj = j;
                queue<int> q;
                q.push(si);
                q.push(sj);
                q.push(0);

                vector<vector<bool>> visited(n, vector<bool>(m, false));
                int broj_na_cvekinja = 0;
                while(!q.empty()) {
                    int ci = q.front();
                    q.pop();
                    int cj = q.front();
                    q.pop();
                    int dist = q.front();
                    q.pop();

                    if(mat[ci][cj] == 'C') {
                        broj_na_cvekinja++;
                    }
                    if(broj_na_cvekinja > result) {
                        result = broj_na_cvekinja;
                        ri = i + 1;
                        rj = j + 1;
                    }

                    for(int k = 0; k < 4; k++) {
                        int ti = ci + di[k];
                        int tj = cj + dj[k];

                        if(ti >= 0 and ti < n and tj >= 0 and tj < m and mat[ti][tj] != '#' and !visited[ti][tj] and dist + 1 <= W) {
                            q.push(ti);
                            q.push(tj);
                            q.push(dist + 1);
                            visited[ti][tj] = true;
                        }
                    }
                }

            }
        }
    }

    cout << ri << " " << rj << endl;


    return 0;

}