#include <bits/stdc++.h>
using namespace std;
const int MN = 311;
int m, n, k;
char a[MN][MN];
vector<tuple<int, int, int> > res;
int main() {
  ios ::sync_with_stdio(false);
  while (cin >> m >> n >> k) {
    for (int i = (1), _b = (m); i <= _b; i++)
      for (int j = (1), _b = (n); j <= _b; j++) cin >> a[i][j];
    res.clear();
    for (int i = (1), _b = (m); i <= _b; i++)
      for (int j = (1), _b = (n); j <= _b; j++)
        if (a[i][j] == '*')
          for (int x = (1), _b = (min(m, n)); x <= _b; x++) {
            if (i - x < 1 || i + x > m || j - x < 1 || j + x > n) continue;
            if (a[i - x][j] == '*' && a[i + x][j] == '*' &&
                a[i][j - x] == '*' && a[i][j + x] == '*') {
              res.push_back(make_tuple(x, i, j));
            }
          }
    sort(res.begin(), res.end());
    --k;
    if (k >= res.size())
      cout << -1 << endl;
    else {
      int x = get<0>(res[k]);
      int i = get<1>(res[k]);
      int j = get<2>(res[k]);
      cout << i << ' ' << j << endl;
      cout << i - x << ' ' << j << endl;
      cout << i + x << ' ' << j << endl;
      cout << i << ' ' << j - x << endl;
      cout << i << ' ' << j + x << endl;
    }
  }
  return 0;
}
