#include <bits/stdc++.h>
using namespace std;
char str[305][305];
int n, m, k;
vector<pair<int, int>> vec[305];
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; ++i) {
    scanf(" %s", str[i] + 1);
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      if (str[i][j] == '*') {
        int v = 1e9;
        v = min(i - 1, n - i);
        v = min(v, min(j - 1, m - j));
        for (int d = 1; d <= v; ++d) {
          bool c = 1;
          c &= (str[i - d][j] == '*');
          c &= (str[i + d][j] == '*');
          c &= (str[i][j - d] == '*');
          c &= (str[i][j + d] == '*');
          if (c) {
            vec[d].push_back(make_pair(i, j));
          }
        }
      }
    }
  }
  int x = -1, y = -1, d = -1;
  for (int i = 1; i <= 300; ++i) {
    if ((int)vec[i].size() >= k) {
      x = vec[i][k - 1].first;
      y = vec[i][k - 1].second;
      d = i;
      break;
    }
    k -= (int)vec[i].size();
  }
  if (~x) {
    printf("%d %d\n", x, y);
    printf("%d %d\n", x - d, y);
    printf("%d %d\n", x + d, y);
    printf("%d %d\n", x, y - d);
    printf("%d %d\n", x, y + d);
  } else {
    puts("-1");
  }
}
