#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  char matriz[n][m];
  vector<vector<pair<int, int>>> v;
  int k1 = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; j++) cin >> matriz[i][j];
  for (int r = 1; r <= min(n, m) / 2; ++r) {
    vector<pair<int, int>> aux;
    for (int i = r; i < n - r; ++i)
      for (int j = r; j < m - r; j++)
        if (matriz[i][j] == '*' && matriz[i + r][j] == '*' &&
            matriz[i][j + r] == '*' && matriz[i - r][j] == '*' &&
            matriz[i][j - r] == '*') {
          aux.push_back({j, i});
          k1++;
        }
    v.push_back(aux);
  }
  if (k1 < k) {
    cout << "-1" << endl;
    return 0;
  }
  int i = 0;
  int temp = 0;
  while (temp + v[i].size() < k) {
    temp += v[i].size();
    i++;
  }
  int cont = -1;
  while (temp != k) {
    temp++;
    cont++;
  }
  cout << v[i][cont].second + 1 << " " << v[i][cont].first + 1 << endl;
  cout << v[i][cont].second + 1 - (i + 1) << " " << v[i][cont].first + 1
       << endl;
  cout << v[i][cont].second + 1 + (i + 1) << " " << v[i][cont].first + 1
       << endl;
  cout << v[i][cont].second + 1 << " " << v[i][cont].first + 1 - (i + 1)
       << endl;
  cout << v[i][cont].second + 1 << " " << v[i][cont].first + 1 + (i + 1)
       << endl;
  return 0;
}
