#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 29;
const int MAXN = 310;
int N, M, K;
bool G[MAXN][MAXN] = {};
bool has_cross(int i, int j, int r) {
  return G[i][j] && G[i - r][j] && G[i + r][j] && G[i][j - r] && G[i][j + r];
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> M >> K;
  for (int i = 0; i < (N); i++) {
    string s;
    cin >> s;
    for (int j = 0; j < (M); j++)
      if (s[j] == '*') G[i][j] = true;
  }
  for (int r = (1); r <= (min(N - 1, M - 1) / 2); r++)
    for (int i = (r); i <= (N - r - 1); i++)
      for (int j = (r); j <= (M - r - 1); j++)
        if (has_cross(i, j, r)) {
          K--;
          if (K == 0) {
            cout << i + 1 << " " << j + 1 << '\n';
            cout << i - r + 1 << " " << j + 1 << '\n';
            cout << i + r + 1 << " " << j + 1 << '\n';
            cout << i + 1 << " " << j - r + 1 << '\n';
            cout << i + 1 << " " << j + r + 1 << '\n';
            return 0;
          }
        }
  cout << -1 << '\n';
  return 0;
}
