#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 303;
struct star {
  short radii, x, y;
  star(short X, short Y, short Rad) { radii = Rad, x = X, y = Y; }
  star(){};
  friend bool operator<(const star &A, const star &B) {
    if (A.radii != B.radii) return A.radii < B.radii;
    if (A.x != B.x) return A.x < B.x;
    return A.y < B.y;
  }
} A;
char s[MAX_N][MAX_N];
int main() {
  int m, n, k;
  scanf("%d%d%d", &m, &n, &k);
  int Idx = 0;
  for (int i = 0; i < m; i++)
    for (int j = 0; j < n; j++) cin >> s[i][j];
  int Max = max(m, n);
  star A;
  bool f = false;
  for (int R = 1; R < Max; R++)
    for (int x = 0; x < m; x++)
      for (int y = 0; y < n; y++)
        if (s[x][y] == '*') {
          if (x + R < m && x - R >= 0 && y + R < n && y - R >= 0 &&
              s[x + R][y] == '*' && s[x - R][y] == '*' && s[x][y + R] == '*' &&
              s[x][y - R] == '*') {
            A = star(x + 1, y + 1, R);
            Idx++;
            if (Idx == k) {
              f = true;
              goto out;
            }
          }
        }
out:;
  if (!f)
    printf("-1\n");
  else {
    printf("%d %d\n", A.x, A.y);
    printf("%d %d\n", A.x - A.radii, A.y);
    printf("%d %d\n", A.x + A.radii, A.y);
    printf("%d %d\n", A.x, A.y - A.radii);
    printf("%d %d\n", A.x, A.y + A.radii);
  }
}
