#include <bits/stdc++.h>
using namespace std;
struct star {
  int x;
  int y;
};
int main() {
  star q;
  int n, m, k1, too = 0;
  scanf("%d%d%d", &n, &m, &k1);
  int min = m;
  if (n < m) min = n;
  char a[301][301], c;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int d = 1; d <= (min / 2 + 1); d++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if ((i - d) < 0) break;
        if (((i - d) < 0) || ((i + d) >= n) || ((j - d) < 0) || ((j + d) >= m))
          ;
        else if (a[i][j] == '*') {
          if ((a[i - d][j] == '*') && (a[i + d][j] == '*') &&
              (a[i][j - d] == '*') && (a[i][j + d] == '*')) {
            too++;
            q.x = i;
            q.y = j;
            if (too == k1) {
              printf("%d %d\n", q.x + 1, q.y + 1);
              printf("%d %d\n", q.x - d + 1, q.y + 1);
              printf("%d %d\n", q.x + d + 1, q.y + 1);
              printf("%d %d\n", q.x + 1, q.y - d + 1);
              printf("%d %d\n", q.x + 1, q.y + d + 1);
              return 0;
            }
          }
        }
      }
    }
  }
  printf("-1\n");
  return 0;
}
