#include <bits/stdc++.h>
using namespace std;
vector<pair<int, pair<int, int> > > pre;
vector<vector<pair<int, int> > > ans;
char a[301][301];
bool b[301][301];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  int d = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) scanf(" %c", &a[i][j]);
  for (int i = 1; i < n - 1; i++)
    for (int j = 1; j < m - 1; j++)
      if (a[i][j] == '*')
        for (int l = 1; l <= min(m - j - 1, min(j, min(i, n - i - 1))); l++)
          if (a[i - l][j] == a[i][j] && a[i][j] == a[i + l][j] &&
              a[i][j] == a[i][j + l] && a[i][j] == a[i][j - l])
            pre.push_back(make_pair(l, make_pair(i, j)));
  if (pre.size() < k) {
    cout << -1 << '\n';
    return 0;
  }
  sort(pre.begin(), pre.end());
  int fak = pre[k - 1].first;
  int x = ++pre[k - 1].second.first;
  int y = ++pre[k - 1].second.second;
  printf("%d %d\n", x, y);
  printf("%d %d\n", x - fak, y);
  printf("%d %d\n", x + fak, y);
  printf("%d %d\n", x, y - fak);
  printf("%d %d\n", x, y + fak);
  return 0;
}
