func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( O3 )   #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx )   using namespace std;   const int MAXN = 1e5 + 9;   const int MOD = (int)(1e9 + 7);   const int LOG2MAXN = 17;   const int INF = 1e9;   const long double eps = 1e-9;   int di[] = {0, 1, 0, -1};   int dj[] = {1, 0, -1, 0};   char ddir[] = { R ,  U ,  L ,  D };   mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());   int n, m;   vector<vector<int> > gg;   bool used[MAXN];   void cry() {     cout <<  NO ;     exit(0);   }   int ans[111][111];   char cc[111][111];   void solve() {     int n, k;     cin >> n >> k;     for (int i = 0; i < n; i++)       for (int j = 0; j < n; j++) cin >> cc[i][j];     int mx = 0;     for (int i = 0; i < n; i++) {       for (int j = 0; j < n; j++) {         bool ok = 1;         for (int tmp = 0; tmp < k; tmp++)           if (i + tmp >= n || cc[i + tmp][j] ==  # ) ok = 0;         if (ok)           for (int tmp = 0; tmp < k; tmp++) ans[i + tmp][j]++;         ok = 1;         for (int tmp = 0; tmp < k; tmp++)           if (j + tmp >= n || cc[i][j + tmp] ==  # ) ok = 0;         if (ok)           for (int tmp = 0; tmp < k; tmp++) ans[i][j + tmp]++;         mx = max(mx, ans[i][j]);       }     }     for (int i = 0; i < n; i++)       for (int j = 0; j < n; j++)         if (ans[i][j] == mx) {           cout << i + 1 <<     << j + 1 << endl;           return;         }   }   void input() {}   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     input();     solve();     return 0;   }   