#include <bits/stdc++.h>
using namespace std;
char Map[400][400];
int N, M, K;
void Init() {
  cin >> N >> M >> K;
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= M; j++) cin >> Map[i][j];
}
void Solve() {
  for (int i = 1; i <= (N + 1) / 2 || i <= (M + 1) / 2; i++) {
    for (int x = 1; x <= N; x++)
      for (int y = 1; y <= M; y++) {
        if (x - i >= 1 && y - i >= 1 && x + i <= N && y + i <= M)
          ;
        else
          continue;
        if (Map[x][y] == '*' && Map[x - i][y] == '*' && Map[x + i][y] == '*' &&
            Map[x][y - i] == '*' && Map[x][y + i] == '*') {
          K--;
          if (K == 0) {
            cout << x << " " << y << "\n";
            cout << x - i << " " << y << "\n";
            cout << x + i << " " << y << "\n";
            cout << x << " " << y - i << "\n";
            cout << x << " " << y + i << "\n";
            return;
          }
        }
      }
  }
  cout << "-1\n";
  return;
}
int main() {
  Init();
  Solve();
  return 0;
}
