#include <bits/stdc++.h>
using namespace std;
const int N = 310;
int r[N];
char g[N][N];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i < n; i++) scanf("%s", g[i]);
  int cnt = 0;
  for (int x = 1; x < 150; x++) {
    for (int i = x; i + x - 1 < n; i++) {
      for (int j = x; j + x - 1 < m; j++) {
        if (g[i][j] != '*') continue;
        bool ok = true;
        for (int d = 0; d < 4 and ok; d++) {
          int ni = i + dir[d][0] * x;
          int nj = j + dir[d][1] * x;
          if (g[ni][nj] != '*') ok = false;
        }
        if (ok) cnt++;
        if (cnt == k) {
          printf("%d %d\n", i + 1, j + 1);
          for (int d = 0; d < 4; d++) {
            int ni = i + dir[d][0] * x;
            int nj = j + dir[d][1] * x;
            printf("%d %d\n", ni + 1, nj + 1);
          }
          return 0;
        }
      }
    }
  }
  printf("-1\n");
  return 0;
}
