func_code_string: #include <bits/stdc++.h>   using namespace std;   int n, m, k;   string s;   vector<string> t;   vector<pair<pair<int, int>, int> > cro;   bool cmp(const pair<pair<int, int>, int> &x,            const pair<pair<int, int>, int> &y) {     if (x.second == y.second) {       if (x.first.first == y.first.first) return x.first.second < y.first.second;       return x.first.first < y.first.first;     }     return x.second < y.second;   }   int main() {     cin >> n >> m >> k;     for (int i = 0; i < (n); i++) {       cin >> s;       t.push_back(s);     }     for (int i = 0; i < (n); i++) {       for (int j = 0; j < (m); j++) {         if (t[i][j] ==  * ) {           for (int r = (1); r <= (min(i, min(j, min(n - i - 1, m - j - 1))));                r++) {             if ((t[i - r][j] ==  * ) && (t[i + r][j] ==  * ) &&                 (t[i][j - r] ==  * ) && (t[i][j + r] ==  * ))               cro.push_back(make_pair(make_pair(i, j), r));           }         }       }     }     if (cro.size() < k)       cout <<  -1 n ;     else {       sort((cro).begin(), (cro).end(), cmp);       cout << cro[k - 1].first.first + 1 <<     << cro[k - 1].first.second + 1            <<   n ;       cout << cro[k - 1].first.first + 1 - cro[k - 1].second <<                << cro[k - 1].first.second + 1 <<   n ;       cout << cro[k - 1].first.first + 1 + cro[k - 1].second <<                << cro[k - 1].first.second + 1 <<   n ;       cout << cro[k - 1].first.first + 1 <<                << cro[k - 1].first.second + 1 - cro[k - 1].second <<   n ;       cout << cro[k - 1].first.first + 1 <<                << cro[k - 1].first.second + 1 + cro[k - 1].second <<   n ;     }     return 0;   }   