#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ulint = unsigned long long;
const int N = 300 + 1;
char grid[N][N];
int cnt[N];
bool star(int i, int j) {
  return i >= 0 && j >= 0 && i < N && j < N && grid[i][j] == '*';
}
void solve(int n, int m, int x, int k) {
  vector<pair<int, int>> vec;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (star(i, j) && star(i + x, j) && star(i - x, j) && star(i, j + x) &&
          star(i, j - x)) {
        vec.emplace_back(i, j);
      }
    }
  }
  sort(vec.begin(), vec.end());
  auto [i, j] = vec[k - 1];
  i++;
  j++;
  cout << i << " " << j << "\n";
  cout << i - x << " " << j << "\n";
  cout << i + x << " " << j << "\n";
  cout << i << " " << j - x << "\n";
  cout << i << " " << j + x << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> grid[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      for (int x = 1; x < N; x++) {
        cnt[x] += star(i, j) && star(i + x, j) && star(i - x, j) &&
                  star(i, j + x) && star(i, j - x);
      }
    }
  }
  for (int x = 1; x < N; x++) {
    if (cnt[x] >= k) {
      solve(n, m, x, k);
      return 0;
    }
    k -= cnt[x];
  }
  cout << -1 << "\n";
}
