#include <bits/stdc++.h>
using namespace std;
char grid[200][200];
int sum[200][200];
int main() {
  int n, k;
  cin >> n >> k;
  memset(grid, 0, sizeof(grid));
  for (int i = 1; i <= n; i++) {
    getchar();
    for (int j = 1; j <= n; j++) {
      scanf("%c", &grid[i][j]);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      bool flag = true;
      for (int y = 0; y < k; y++) {
        if (grid[i][j + y] != '.' || (j + y > n)) {
          flag = false;
          break;
        }
      }
      if (flag) {
        for (int z = 0; z < k; z++) {
          sum[i][j + z]++;
        }
      }
    }
  }
  for (int j = 1; j <= n; j++) {
    for (int i = 1; i <= n; i++) {
      bool flag = true;
      for (int y = 0; y < k; y++) {
        if (grid[i + y][j] != '.' || (i + y > n)) flag = false;
      }
      if (flag) {
        for (int z = 0; z < k; z++) {
          sum[i + z][j]++;
        }
      }
    }
  }
  tuple<int, int, int> ans;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      ans = max(ans, tuple<int, int, int>(sum[i][j], i, j));
    }
  }
  cout << get<1>(ans) << " " << get<2>(ans) << endl;
  return 0;
}
