#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int MAX = 3e2 + 5;
const long long MAX2 = 11;
const long long MOD = 1000000007;
const long long MOD2 = 1000005329;
const long long INF = 2e18;
const int dr[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
const double pi = acos(-1);
const double EPS = 1e-9;
const int block = 2000;
int n, m, k, a, b, c, d, sz, y, z;
char x[MAX][MAX];
vector<pair<int, int> > v[MAX];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) cin >> x[i][j];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      if (x[i][j] != '*') continue;
      a = b = j, c = d = i;
      sz = 0;
      while (a > 1 && b < m && c > 1 && d < n) {
        --a, ++b, --c, ++d, ++sz;
        if (x[i][a] == '*' && x[i][b] == '*' && x[c][j] == '*' &&
            x[d][j] == '*')
          v[sz].push_back({i, j});
      }
    }
  for (int i = 1; i <= 300; ++i) {
    if (k > v[i].size())
      k -= v[i].size();
    else {
      sort(v[i].begin(), v[i].end());
      y = v[i][k - 1].first, z = v[i][k - 1].second;
      cout << y << ' ' << z << '\n';
      cout << y - i << ' ' << z << '\n';
      cout << y + i << ' ' << z << '\n';
      cout << y << ' ' << z - i << '\n';
      cout << y << ' ' << z + i << '\n';
      return 0;
    }
  }
  cout << "-1\n";
  return 0;
}
