#include <bits/stdc++.h>
char s[300 * 300 + 1];
int main(int agrc, char *argv[]) {
  int n, m, k;
  scanf("%d %d %d ", &n, &m, &k);
  for (int i = 0; i < n; i++) scanf("%s", &s[i * m]);
  int rmax = (n > m) ? m / 2 : n / 2;
  int r = 1, y, x;
  while (r <= rmax && k > 0) {
    y = r;
    while (y < n - r && k > 0) {
      x = r;
      while (x < m - r && k > 0) {
        if (s[y * m + x] == '*' && s[(y - r) * m + x] == '*' &&
            s[(y + r) * m + x] == '*' && s[y * m + (x - r)] == '*' &&
            s[y * m + (x + r)] == '*') {
          k--;
        }
        x++;
      }
      y++;
    }
    if (k > 0) {
      r++;
    }
  }
  if (k == 0) {
    printf("%d %d\n%d %d\n%d %d\n%d %d\n%d %d\n", y, x, y - r, x, y + r, x, y,
           x - r, y, x + r);
  } else {
    printf("-1\n");
  }
  return 0;
}
