#include <bits/stdc++.h>
using namespace std;
int n, m, k;
bool str[400][400];
map<int, vector<pair<int, int>>> ma;
map<int, vector<pair<int, int>>>::iterator it;
vector<pair<pair<int, int>, int>> v;
bool check(int i, int j, int rad) {
  if (i - rad > 0 && i + rad <= n && j - rad > 0 && j + rad <= m && str[i][j] &&
      str[i - rad][j] && str[i + rad][j] && str[i][j - rad] &&
      str[i][j + rad]) {
    return true;
  }
  return false;
}
int main() {
  char ch;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> ch;
      str[i][j] = (ch == '*') ? true : false;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      for (int x = 1; x <= max(n, m); x++) {
        if (check(i, j, x)) {
          ma[x].push_back(make_pair(i, j));
        }
      }
    }
  }
  for (it = ma.begin(); it != ma.end(); it++) {
    for (int i = 0; i < ((*it).second).size(); i++) {
      v.push_back(make_pair(((*it).second)[i], (*it).first));
    }
  }
  if (k > v.size())
    cout << "-1" << endl;
  else {
    int rad = v[k - 1].second;
    int i = v[k - 1].first.first;
    int j = v[k - 1].first.second;
    printf("%d %d\n%d %d\n%d %d\n%d %d\n%d %d", i, j, i - rad, j, i + rad, j, i,
           j - rad, i, j + rad);
  }
  return 0;
}
