#include <bits/stdc++.h>
using namespace std;
const int MAXK = 2 * 10000000;
struct sozv {
  int x, y, r;
  sozv(){};
  sozv(int x, int y, int r) : x(x), y(y), r(r){};
  friend bool operator<(const sozv& a, const sozv& b) {
    if (a.r != b.r) return a.r < b.r;
    if (a.y != b.y) return a.y < b.y;
    return a.x < b.x;
  }
  friend ostream& operator<<(ostream& s, const sozv& a) {
    s << a.y << ' ' << a.x << endl;
    s << a.y - a.r << ' ' << a.x << endl;
    s << a.y + a.r << ' ' << a.x << endl;
    s << a.y << ' ' << a.x - a.r << endl;
    s << a.y << ' ' << a.x + a.r << endl;
    return s;
  }
};
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<bool> > Q(n + 2, vector<bool>(m + 2));
  for (int i = 1; i <= (n); ++i)
    for (int j = 1; j <= (m); ++j) {
      char c;
      cin >> c;
      if (c == '*') Q[i][j] = true;
    }
  vector<sozv> S;
  S.reserve(MAXK);
  for (int y = 1; y <= (n); ++y)
    for (int x = 1; x <= (m); ++x) {
      if (Q[y][x]) {
        int r = min(min(y, n - y), min(x, m - x));
        if (r) {
          for (int ir = r; ir >= 1; --ir) {
            if (Q[y + ir][x] && Q[y - ir][x] && Q[y][x + ir] && Q[y][x - ir]) {
              S.push_back(sozv(x, y, ir));
            }
          }
        }
      }
    }
  sort(S.begin(), S.end());
  if (k > S.size()) {
    cout << -1 << endl;
  } else {
    --k;
    cout << S[k] << endl;
  }
  return 0;
}
