#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long getnum() {
  char c = getchar();
  long long num, sign = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; c >= '0' && c <= '9';) {
    c -= '0';
    num = num * 10 + c;
    c = getchar();
  }
  return num * sign;
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (0); i < (b); i++) {
    multiply *= a;
  }
  return multiply;
}
int n, m, kth;
char a[302][302];
bool check(int x, int y) {
  return x >= 0 && x < n && y >= 0 && y < m && a[x][y] == '*';
}
bool isStar(int x, int y, int len) {
  if (check(x - len, y) && check(x + len, y) && check(x, y - len) &&
      check(x, y + len))
    return true;
  return false;
}
int main() {
  int test, cases = 1;
  cin >> n >> m >> kth;
  for (int i = (0); i < (n); i++) {
    for (int j = (0); j < (m); j++) cin >> a[i][j];
  }
  for (int i = (1); i < (151); i++) {
    for (int j = (0); j < (n); j++) {
      for (int k = (0); k < (m); k++) {
        if (a[j][k] == '*' && isStar(j, k, i)) {
          kth--;
          if (kth == 0) {
            cout << j + 1 << " " << k + 1 << "\n";
            cout << j - i + 1 << " " << k + 1 << "\n";
            cout << j + i + 1 << " " << k + 1 << "\n";
            cout << j + 1 << " " << k - i + 1 << "\n";
            cout << j + 1 << " " << k + i + 1 << "\n";
            return 0;
          }
        }
      }
    }
  }
  cout << -1 << "\n";
  return 0;
}
