#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double pi = acos(-1.0);
int dblcmp(double d) {
  if (fabs(d) < eps) return 0;
  return d > eps ? 1 : -1;
}
int n, m, d;
char s[333][333];
struct node {
  short x, y, l;
  node() {}
  node(short _x, short _y, short _l) {
    x = _x;
    y = _y;
    l = _l;
  }
  bool operator<(const node gg) const {
    if (l == gg.l) {
      if (x == gg.x) return y < gg.y;
      return x < gg.x;
    }
    return l < gg.l;
  }
};
vector<node> a;
int main() {
  int i, j, k;
  scanf("%d%d%d", &n, &m, &d);
  for (i = 0; i < n; i++) scanf("%s", s[i]);
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      if (s[i][j] != '*') continue;
      int l = min(i, j);
      l = min(l, min(n - i - 1, m - j - 1));
      for (k = 1; k <= l; k++) {
        if (i - k >= 0 && s[i - k][j] == '*' && i + k < n &&
            s[i + k][j] == '*' && j - k >= 0 && s[i][j - k] == '*' &&
            j + k < m && s[i][j + k] == '*') {
          a.push_back(node(i, j, k));
        }
      }
    }
  }
  sort(a.begin(), a.end());
  if (d > (int)((a).size())) {
    puts("-1");
    return 0;
  }
  d--;
  int x = (int)a[d].x, y = (int)a[d].y, l = (int)a[d].l;
  x++;
  y++;
  printf("%d %d\n", x, y);
  printf("%d %d\n", x - l, y);
  printf("%d %d\n", x + l, y);
  printf("%d %d\n", x, y - l);
  printf("%d %d\n", x, y + l);
  return 0;
}
