#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  int n, k;
  while (cin >> n >> k) {
    vector<string> cells(n);
    for (int i = 0; i < n; i++) cin >> cells[i];
    int mx = 0, ansR = 0, ansC = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (cells[i][j] == '#') continue;
        int u = i, d = i;
        while (u - 1 >= 0 && cells[u - 1][j] == '.') --u;
        while (d + 1 < n && cells[d + 1][j] == '.') ++d;
        int l = j, r = j;
        while (l - 1 >= 0 && cells[i][l - 1] == '.') --l;
        while (r + 1 < n && cells[i][r + 1] == '.') ++r;
        int wr = max(0, min(i, d - k + 1) - max(u, i - k + 1) + 1);
        int wc = max(0, min(j, r - k + 1) - max(l, j - k + 1) + 1);
        int ways = wr + wc;
        if (ways > mx) {
          mx = ways;
          ansR = i;
          ansC = j;
        }
      }
    }
    cout << (ansR + 1) << " " << (ansC + 1) << endl;
  }
  return 0;
}
