#include <bits/stdc++.h>
using namespace std;
int n, m, k;
char S[302][302];
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i < n; i++) {
    scanf("%s", S[i]);
  }
  for (int r = 1; r <= min(m, n); r++) {
    for (int i = 0; i <= n - 1; i++) {
      for (int j = 0; j <= m - 1; j++) {
        if (S[i][j] != '*') continue;
        bool ok = true;
        for (int t = 0; t < 4; t++) {
          int nx = i + r * dx[t], ny = j + r * dy[t];
          if (nx < 0 || ny < 0 || nx >= n || ny >= m || S[nx][ny] != '*') {
            ok = false;
            break;
          }
        }
        if (ok) {
          k--;
          if (k == 0) {
            printf("%d %d\n", (i + 1), (j + 1));
            for (int t = 0; t < 4; t++) {
              int nx = i + r * dx[t], ny = j + r * dy[t];
              printf("%d %d\n", nx + 1, ny + 1);
            }
            return 0;
          }
        }
      }
    }
  }
  if (k > 0) printf("-1\n");
  return 0;
}
