#include <bits/stdc++.h>
using namespace std;
int n, k, b[110][110];
char c[110][110];
void have(int x, int y) {
  int sum = 0;
  for (int i = x; i < min(x + k, n); i++) {
    if (c[i][y] == '.') sum++;
  }
  if (sum == k) {
    for (int i = x; i < min(x + k, n); i++) b[i][y]++;
  }
  sum = 0;
  for (int i = y; i < min(y + k, n); i++) {
    if (c[x][i] == '.') sum++;
  }
  if (sum == k) {
    for (int i = y; i < min(y + k, n); i++) b[x][i]++;
  }
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) cin >> c[i][j];
  }
  int x = 1, y = 1, max = 0;
  memset(b, 0, sizeof(b));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (c[i][j] == '.') have(i, j);
      if (b[i][j] > max) {
        max = b[i][j];
        x = i + 1;
        y = j + 1;
      }
    }
  }
  cout << x << " " << y;
}
