#include <bits/stdc++.h>
using namespace std;
char a[105][105];
int n, k, Max, cnt, i, j, m, up, down, l, r;
int main() {
  scanf("%d%d", &n, &k);
  int row = 1, col = 1;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      cin >> a[i][j];
    }
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      cnt = 0, up = 0, down = 0, l = 0, r = 0;
      if (a[i][j] == '#')
        continue;
      else {
        while (j - l >= 1) {
          l++;
          if (a[i][j - l] == '#' || j - l < 1) {
            l--;
            break;
          }
        }
        while (j + r <= n) {
          r++;
          if (a[i][j + r] == '#' || j + r > n) {
            r--;
            break;
          }
        }
        while (i - up >= 1) {
          up++;
          if (a[i - up][j] == '#' || i - up < 1) {
            up--;
            break;
          }
        }
        while (i + down <= n) {
          down++;
          if (a[i + down][j] == '#' || i + down > n) {
            down--;
            break;
          }
        }
        for (m = 1; m <= k; m++) {
          if (up >= m - 1 && down >= k - m) cnt++;
          if (l >= m - 1 && r >= k - m) cnt++;
        }
        if (cnt > Max) {
          Max = cnt;
          row = i;
          col = j;
        }
      }
    }
  }
  printf("%d %d\n", row, col);
  return 0;
}
