#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 4;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  char c[n + 1][m + 1];
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> c[i][j];
    }
  }
  vector<pair<int, pair<int, int>>> v;
  for (int i = 2; i < n; i++) {
    for (int j = 2; j < m; j++) {
      if (c[i][j] == '*') {
        int klimit = min((min(i - 1, j - 1)), min(n - i, m - j));
        for (int k1 = 1; k1 <= klimit; k1++) {
          if ((c[i + k1][j] == '*') && (c[i - k1][j] == '*') &&
              (c[i][j - k1] == '*') && (c[i][j + k1] == '*')) {
            v.push_back({k1, {i, j}});
          }
        }
      }
    }
  }
  sort(v.begin(), v.end());
  if (v.size() < k) {
    cout << "-1" << '\n';
  } else {
    int cenx = v[k - 1].second.first;
    int ceny = v[k - 1].second.second;
    int incre = v[k - 1].first;
    cout << cenx << " " << ceny << '\n';
    cout << cenx - incre << " " << ceny << '\n';
    cout << cenx + incre << " " << ceny << '\n';
    cout << cenx << " " << ceny - incre << '\n';
    cout << cenx << " " << ceny + incre << '\n';
  }
  return 0;
}
