#include <bits/stdc++.h>
using namespace std;
bool g[100 + 1][100 + 1];
int res[100 + 1][100 + 1];
void dfs(int x, int y, int currK, int n, int k, bool dir) {
  if (!g[x][y]) {
    return;
  }
  if (currK == 0) {
    if (dir) {
      for (int i = 0; i < k; ++i) {
        ++res[x - i][y];
      }
    } else {
      for (int i = 0; i < k; ++i) {
        ++res[x][y - i];
      }
    }
    return;
  }
  if (dir) {
    if (x + currK >= n) {
      return;
    }
    dfs(x + 1, y, currK - 1, n, k, dir);
  } else {
    if (y + currK >= n) {
      return;
    }
    dfs(x, y + 1, currK - 1, n, k, dir);
  }
}
int main(int argc, const char* argv[]) {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      char c;
      cin >> c;
      if (c == '#') {
        g[i][j] = 0;
      } else {
        g[i][j] = 1;
      }
      res[i][j] = 0;
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      dfs(i, j, k - 1, n, k, true);
      dfs(i, j, k - 1, n, k, false);
    }
  }
  int maxVal = 0;
  int maxI = 1;
  int maxJ = 1;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (res[i][j] > maxVal) {
        maxVal = res[i][j];
        maxI = i + 1;
        maxJ = j + 1;
      }
    }
  }
  cout << maxI << " " << maxJ;
  return 0;
}
