#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const int INF = (1 << 30) - 1;
int n, m, k;
char g[310][310];
bool G[310][310];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; ++i) scanf("%s", g[i] + 1);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) G[i][j] = (g[i][j] == '*') ? true : false;
  int top = min(n, m);
  for (int r = 1; r <= top; ++r) {
    for (int i = 1 + r; i <= n - r; ++i) {
      for (int j = 1 + r; j <= m - r; ++j)
        if (G[i][j]) {
          if (G[i - r][j] && G[i + r][j] && G[i][j - r] && G[i][j + r]) {
            --k;
            if (k == 0) {
              printf("%d %d\n", i, j);
              printf("%d %d\n", i - r, j);
              printf("%d %d\n", i + r, j);
              printf("%d %d\n", i, j - r);
              printf("%d %d\n", i, j + r);
              break;
            }
          }
        }
      if (k == 0) break;
    }
    if (k == 0) break;
  }
  if (k) printf("-1\n");
  return 0;
}
