#include <bits/stdc++.h>
using namespace std;
bool field[105][105];
int ship[105][105], n, k, maxi, maxj;
void solve() {
  memset(ship, 0, sizeof(ship));
  int blank = 0;
  int i, j, l;
  for (i = 0; i < n; i++) {
    blank = 0;
    for (j = 0; j < n; j++) {
      if (field[i][j] == 0) blank++;
      if (field[i][j] == 1) blank = 0;
      if (blank >= k) {
        for (l = j - k + 1; l <= j; l++) ship[i][l]++;
      }
    }
  }
  for (j = 0; j < n; j++) {
    blank = 0;
    for (i = 0; i < n; i++) {
      if (field[i][j] == 0) blank++;
      if (field[i][j] == 1) blank = 0;
      if (blank >= k) {
        for (l = i - k + 1; l <= i; l++) ship[l][j]++;
      }
    }
  }
  int maxx = ship[0][0];
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (ship[i][j] > maxx) {
        maxx = ship[i][j];
        maxi = i;
        maxj = j;
      }
    }
  }
}
int main() {
  scanf("%d%d", &n, &k);
  int i, j;
  char c;
  getchar();
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      scanf("%c", &c);
      if (c == '.') field[i][j] = 0;
      if (c == '#') field[i][j] = 1;
    }
    getchar();
  }
  solve();
  printf("%d %d\n", maxi + 1, maxj + 1);
  return 0;
}
