#include <bits/stdc++.h>
using namespace std;
string vowel = "aeiouAEIOU";
string vowelY = "aeiouyAEIOUY";
int n, m, k;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
bool valid(int x, int y) { return x >= 0 && x < n && y < m && y >= 0; }
bool comp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  return (a.second < b.second) ||
         (a.second == b.second && a.first.first < b.first.first) ||
         (a.second == b.second && a.first.first == b.first.first &&
          a.first.second < b.first.second);
}
const double pi = acos(-1);
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> k;
  char grid[n][m];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> grid[i][j];
  vector<pair<pair<int, int>, int> > center;
  for (int p = 1; p <= 150 && p < max(n, m); p++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        bool ok = grid[i][j] == '*';
        for (int o = 0; o < 4; o++)
          if (valid(i + dx[o] * p, j + dy[o] * p)) {
            ok = ok && grid[i + dx[o] * p][j + dy[o] * p] == '*';
          } else
            ok = false;
        if (ok) center.push_back({{i + 1, j + 1}, p});
      }
    }
  }
  sort(center.begin(), center.end(), comp);
  if (center.size() < k)
    cout << -1;
  else {
    int x = center[k - 1].first.first;
    int y = center[k - 1].first.second;
    int p = center[k - 1].second;
    cout << x << ' ' << y << endl;
    for (int i = 0; i < 4; i++)
      cout << x + dx[i] * p << ' ' << y + dy[i] * p << endl;
  }
  return 0;
}
