#include <bits/stdc++.h>
using namespace std;
long long int n, m, k;
char mat[303][303];
void testcase() {
  cin >> n >> m >> k;
  for (long long int i = 1; i < n + 1; i++)
    for (long long int j = 1; j < m + 1; j++) cin >> mat[i][j];
  long long int cnt = 0;
  for (long long int radii = 1; radii < (min(n, m) / 2) + 1; radii++) {
    for (long long int i = radii + 1; i < n + 1 - radii; i++) {
      for (long long int j = radii + 1; j < m + 1 - radii; j++) {
        long long int x = radii;
        long long int r = radii;
        if (mat[i][j] == '*' && mat[i + r][j] == '*' && mat[i][j + r] == '*' &&
            mat[i - r][j] == '*' && mat[i][j - r] == '*') {
          --k;
        }
        if (k == 0) {
          cout << i << " " << j << "\n";
          cout << i - x << " " << j << "\n";
          cout << i + x << " " << j << "\n";
          cout << i << " " << j - x << "\n";
          cout << i << " " << j + x << "\n";
          return;
        }
      }
    }
  }
  cout << -1 << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) testcase();
  return 0;
}
