#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int ara[N][N];
int bra[N][N];
int ans[N][N];
char inp[N][N];
int main() {
  int n = 0;
  int k = 0;
  scanf("%d %d\n", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%s\n", inp[i]);
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (inp[i][j] == '.') ara[i][j] = 1;
      if (j == 0) continue;
      if (inp[i][j] == '.') ara[i][j] += ara[i][j - 1];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = n - 1; j >= 0; --j) {
      if (inp[i][j] == '.') bra[i][j] = 1;
      if (j == n - 1) continue;
      if (inp[i][j] == '.') bra[i][j] += bra[i][j + 1];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (inp[i][j] == '.') {
        for (int t = 0; t < k; ++t) {
          if (bra[i][j] >= k - t && ara[i][j] - 1 >= t) ans[i][j] += 1;
        }
      }
    }
  }
  memset(ara, 0, sizeof(ara));
  memset(bra, 0, sizeof(bra));
  for (int j = 0; j < n; ++j) {
    for (int i = 0; i < n; ++i) {
      if (inp[i][j] == '.') ara[i][j] = 1;
      if (i == 0) continue;
      if (inp[i][j] == '.') ara[i][j] += ara[i - 1][j];
    }
  }
  for (int j = 0; j < n; ++j) {
    for (int i = n - 1; i >= 0; --i) {
      if (inp[i][j] == '.') bra[i][j] = 1;
      if (i == n - 1) continue;
      if (inp[i][j] == '.') bra[i][j] += bra[i + 1][j];
    }
  }
  int x = 0;
  int y = 0;
  int m = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (inp[i][j] == '.') {
        for (int t = 0; t < k; ++t) {
          if (bra[i][j] >= k - t && ara[i][j] - 1 >= t) ans[i][j] += 1;
        }
        if (ans[i][j] > m) {
          x = i;
          y = j;
          m = ans[i][j];
        }
      }
    }
  }
  printf("%d %d\n", x + 1, y + 1);
  return 0;
}
