#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  k--;
  char c[n][m];
  vector<pair<int, pair<int, int> > > v;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> c[i][j];
    }
  }
  for (int i = 1; i < n - 1; i++) {
    for (int j = 1; j < m - 1; j++) {
      if (c[i][j] == '*') {
        for (int r = 1; i - r >= 0 && j - r >= 0 && i + r < n && j + r < m;
             r++) {
          if (c[i][j + r] == '*' && c[i][j - r] == '*' && c[i - r][j] == '*' &&
              c[i + r][j] == '*') {
            v.push_back(make_pair(r, make_pair(i, j)));
          }
        }
      }
    }
  }
  sort(v.begin(), v.end());
  if (k >= v.size()) {
    cout << "-1" << endl;
    return 0;
  }
  cout << v[k].second.first + 1 << " " << v[k].second.second + 1 << endl;
  cout << v[k].second.first - v[k].first + 1 << " " << v[k].second.second + 1
       << endl;
  cout << v[k].second.first + v[k].first + 1 << " " << v[k].second.second + 1
       << endl;
  cout << v[k].second.first + 1 << " " << v[k].second.second - v[k].first + 1
       << endl;
  cout << v[k].second.first + 1 << " " << v[k].second.second + v[k].first + 1
       << endl;
  return 0;
}
