#include <bits/stdc++.h>
using namespace std;
long long n, m, k, cnt = 0;
char tmp;
vector<vector<long long>> a;
map<long long, vector<pair<long long, long long>>> c;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  a.resize(n, vector<long long>(m));
  for (long long i = 0; i < (n); ++i)
    for (long long j = 0; j < (m); ++j) {
      cin >> tmp;
      if (tmp == '*') a[i][j]++;
    }
  for (long long i = 1; i < n - 1; i++) {
    for (long long j = 1; j < m - 1; j++) {
      if (a[i][j]) {
        for (long long l = 1; l <= min(min(i, n - i - 1), min(j, m - j - 1));
             l++) {
          if (a[i - l][j] && a[i + l][j] && a[i][j - l] && a[i][j + l]) {
            cnt++;
            c[l].push_back(make_pair(i, j));
          }
        }
      }
    }
  }
  if (cnt < k)
    cout << -1;
  else {
    for (auto i = (c).begin(); i != (c).end(); ++i) {
      if (i->second.size() < k)
        k -= i->second.size();
      else {
        cout << i->second[k - 1].first + 1 << " " << i->second[k - 1].second + 1
             << "\n";
        cout << i->second[k - 1].first - i->first + 1 << " "
             << i->second[k - 1].second + 1 << "\n";
        cout << i->second[k - 1].first + i->first + 1 << " "
             << i->second[k - 1].second + 1 << "\n";
        cout << i->second[k - 1].first + 1 << " "
             << i->second[k - 1].second - i->first + 1 << "\n";
        cout << i->second[k - 1].first + 1 << " "
             << i->second[k - 1].second + i->first + 1 << "\n";
        return 0;
      }
    }
  }
}
