#include <bits/stdc++.h>
using namespace std;
const int MAXN = 307;
const int MAXM = 307;
const char STAR = '*';
const char EMPTY = '.';
int i, j, k, n, m, r, t, x, y, cnt, mn;
bool found;
char mp[MAXN][MAXM];
bool ok(int x, int y, int r) {
  if (mp[x][y] != STAR) return false;
  if (x - r < 0 || mp[x - r][y] != STAR) return false;
  if (x + r >= n || mp[x + r][y] != STAR) return false;
  if (y - r < 0 || mp[x][y - r] != STAR) return false;
  if (y + r >= m || mp[x][y + r] != STAR) return false;
  return true;
}
void finish(int x, int y, int r) {
  cout << x + 1 << " " << y + 1 << endl;
  cout << x - r + 1 << " " << y + 1 << endl;
  cout << x + r + 1 << " " << y + 1 << endl;
  cout << x + 1 << " " << y - r + 1 << endl;
  cout << x + 1 << " " << y + r + 1 << endl;
  found = true;
}
int main() {
  while (~scanf("%d%d%d", &n, &m, &r)) {
    for (i = 0; i < n; i++) {
      scanf("%s", mp[i]);
    }
    cnt = 0;
    found = false;
    mn = min(n, m) / 2;
    for (k = 1; k <= mn; k++) {
      for (i = 0; i < n; i++) {
        for (j = 0; j < m; j++) {
          if (ok(i, j, k)) {
            cnt++;
          }
          if (cnt == r) {
            finish(i, j, k);
            if (found) break;
          }
        }
        if (found) break;
      }
      if (found) break;
    }
    if (!found) {
      cout << "-1" << endl;
    }
    cout << endl;
  }
  return 0;
}
