#include <bits/stdc++.h>
using namespace std;
void solutionD();
int main() {
  ios_base::sync_with_stdio(false);
  solutionD();
  return EXIT_SUCCESS;
}
long long n, m, k;
char a[512][512];
vector<pair<long long, long long>> p[512];
void solve() {
  for (long long i = 0; i < n; ++i)
    for (long long j = 0; j < m; ++j) {
      if (a[i][j] != '*') continue;
      for (long long r = 1; i + r < n && j + r < m && i - r >= 0 && j - r >= 0;
           ++r)
        if (a[i + r][j] == '*' && a[i - r][j] == '*' && a[i][j + r] == '*' &&
            a[i][j - r] == '*')
          p[r].emplace_back(i, j);
    }
  for (long long r = 1; r < 512; ++r) {
    if (p[r].size() >= k) {
      long long x = p[r][k - 1].first, y = p[r][k - 1].second;
      cout << x + 1 << " " << y + 1 << endl;
      cout << x + 1 - r << " " << y + 1 << endl;
      cout << x + 1 + r << " " << y + 1 << endl;
      cout << x + 1 << " " << y + 1 - r << endl;
      cout << x + 1 << " " << y + 1 + r << endl;
      return;
    }
    k -= p[r].size();
  }
  cout << -1 << endl;
}
void solutionD() {
  for (; cin >> n >> m >> k;) {
    for (long long i = 1; i < 512; ++i) p[i].clear();
    for (long long i = 0; i < n; ++i)
      for (long long j = 0; j < m; ++j) cin >> a[i][j];
    solve();
    cerr << endl;
  }
}
