#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<vector<char>> mapa;
  vector<pair<int, pair<int, int>>> c;
  int n, m, k;
  int x1, x2;
  cin >> n >> m >> k;
  mapa = vector<vector<char>>(n, vector<char>(m));
  for (auto& el : mapa)
    for (char& elem : el) cin >> elem;
  for (int i = 1; i < n - 1; i++) {
    x1 = min(i, n - i - 1);
    for (int j = 1; j < m - 1; j++) {
      if (mapa[i][j] == '.') continue;
      x2 = min(j, m - j - 1);
      for (int x = min(x1, x2); x > 0; x--) {
        if (mapa[i - x][j] == '*' && mapa[i + x][j] == '*' &&
            mapa[i][j - x] == '*' && mapa[i][j + x] == '*') {
          c.push_back({x, {i + 1, j + 1}});
        }
      }
    }
  }
  if ((int)c.size() < k) {
    printf("%d\n", -1);
    return 0;
  }
  sort(begin(c), end(c));
  printf("%d %d\n", c[k - 1].second.first, c[k - 1].second.second);
  printf("%d %d\n", c[k - 1].second.first - c[k - 1].first,
         c[k - 1].second.second);
  printf("%d %d\n", c[k - 1].second.first + c[k - 1].first,
         c[k - 1].second.second);
  printf("%d %d\n", c[k - 1].second.first,
         c[k - 1].second.second - c[k - 1].first);
  printf("%d %d\n", c[k - 1].second.first,
         c[k - 1].second.second + c[k - 1].first);
  return 0;
}
