#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  string w[n + 5];
  int r[n + 5][n + 5], l[n + 5][n + 5], u[n + 5][n + 5], d[n + 5][n + 5];
  for (int i = 0; i < n; i++) {
    cin >> w[i];
    int f = -1;
    int ind;
    for (int j = 0; j < n; j++) {
      if (w[i][j] == '.' && f == -1) {
        ind = j, f = 0;
        l[i][j] = ind;
      } else if (w[i][j] == '#') {
        f = -1;
      } else if (w[i][j] == '.' && f == 0) {
        l[i][j] = ind;
      }
    }
    f = -1;
    for (int j = n - 1; j >= 0; j--) {
      if (w[i][j] == '.' && f == -1) {
        ind = j, f = 0;
        r[i][j] = ind;
      } else if (w[i][j] == '#') {
        f = -1;
      } else if (w[i][j] == '.' && f == 0) {
        r[i][j] = ind;
      }
    }
  }
  for (int j = 0; j < n; j++) {
    int f = -1;
    int ind;
    for (int i = 0; i < n; i++) {
      if (w[i][j] == '.' && f == -1) {
        ind = i;
        u[i][j] = ind;
        f = 0;
      } else if (w[i][j] == '#') {
        f = -1;
      } else if (w[i][j] == '.' && f == 0) {
        u[i][j] = ind;
      }
    }
    f = -1;
    for (int i = n - 1; i >= 0; i--) {
      if (w[i][j] == '.' && f == -1) {
        ind = i;
        d[i][j] = ind;
        f = 0;
      } else if (w[i][j] == '#') {
        f = -1;
      } else if (w[i][j] == '.' && f == 0) {
        d[i][j] = ind;
      }
    }
  }
  int mx = 0, row = -1, col = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (w[i][j] == '.') {
        int t = min(j + k - 1, r[i][j]);
        int p = max(j - k + 1, l[i][j]);
        int t1 = min(i + k - 1, d[i][j]);
        int p1 = max(i - k + 1, u[i][j]);
        if (mx < max(0, t - p + 1 - k + 1) + max(t1 - p1 + 1 - k + 1, 0)) {
          mx = max(0, t - p + 1 - k + 1) + max(t1 - p1 + 1 - k + 1, 0);
          row = i + 1, col = j + 1;
        }
      }
    }
  }
  if (row == -1 && col == -1)
    cout << "1 1" << endl;
  else
    cout << row << " " << col << endl;
}
