A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross. This constellation can be formed by any 5 stars so, that for some integer x (radius of the constellation) the following is true: 

  * the 2nd is on the same vertical line as the 1st, but x squares up 
  * the 3rd is on the same vertical line as the 1st, but x squares down 
  * the 4th is on the same horizontal line as the 1st, but x squares left 
  * the 5th is on the same horizontal line as the 1st, but x squares right 



Such constellations can be very numerous, that's why they are numbered with integers from 1 on the following principle: when two constellations are compared, the one with a smaller radius gets a smaller index; if their radii are equal — the one, whose central star if higher than the central star of the other one; if their central stars are at the same level — the one, whose central star is to the left of the central star of the other one.

Your task is to find the constellation with index k by the given Berland's star map.

Input

The first line contains three integers n, m and k (1 ≤ n, m ≤ 300, 1 ≤ k ≤ 3·107) — height and width of the map and index of the required constellation respectively. The upper-left corner has coordinates (1, 1), and the lower-right — (n, m). Then there follow n lines, m characters each — description of the map. j-th character in i-th line is «*», if there is a star in the corresponding square, and «.» if this square is empty.

Output

If the number of the constellations is less than k, output -1. Otherwise output 5 lines, two integers each — coordinates of the required constellation. Output the stars in the following order: central, upper, lower, left, right.

Examples

Input

5 6 1
....*.
...***
....*.
..*...
.***..


Output

2 5
1 5
3 5
2 4
2 6


Input

5 6 2
....*.
...***
....*.
..*...
.***..


Output

-1


Input

7 7 2
...*...
.......
...*...
*.***.*
...*...
.......
...*...


Output

4 4
1 4
7 4
4 1
4 7
#include <bits/stdc++.h>
using namespace std;
template <class T>
void show(T a, int n) {
  for (int i = 0; i < n; ++i) cout << a[i] << ' ';
  cout << endl;
}
template <class T>
void show(T a, int r, int l) {
  for (int i = 0; i < r; ++i) show(a[i], l);
  cout << endl;
}
const int N = 310;
const int M = 5000;
const int oo = 10000 * 10000 * 10;
int n, m, nth;
char g[N][N];
bool go(int x) {
  int i, j, k;
  for (i = 1 + x; i + x <= n; ++i) {
    for (j = 1 + x; j + x <= m; ++j) {
      if (g[i][j] == '*' && g[i - x][j] == '*' && g[i + x][j] == '*' &&
          g[i][j + x] == '*' && g[i][j - x] == '*') {
        --nth;
        if (nth == 0) {
          printf("%d %d\n", i, j);
          printf("%d %d\n", i - x, j);
          printf("%d %d\n", i + x, j);
          printf("%d %d\n", i, j - x);
          printf("%d %d\n", i, j + x);
          return true;
        }
      }
    }
  }
  return false;
}
int main() {
  int i, j, cas = 0;
  scanf("%d %d %d", &n, &m, &nth);
  for (i = 1; i <= n; ++i) scanf("%s", g[i] + 1);
  for (i = 1; i <= n; ++i)
    if (go(i)) {
      return 0;
    }
  puts("-1");
  return 0;
}
