#include <bits/stdc++.h>
using namespace std;
const int N = 150;
int n, k;
int accH[N][N], accV[N][N];
string g[N];
bool checkH(int x, int y1, int y2) {
  if (y1 < 0 || y2 >= n) return 0;
  int ret = 0;
  if (y1 == 0)
    ret = accH[x][y2];
  else
    ret = accH[x][y2] - accH[x][y1 - 1];
  if (ret)
    return 0;
  else
    return 1;
}
bool checkV(int y, int x1, int x2) {
  if (x1 < 0 || x2 >= n) return 0;
  int ret = 0;
  if (x1 == 0) {
    ret = accV[x2][y];
  } else {
    ret = accV[x2][y] - accV[x1 - 1][y];
  }
  if (ret)
    return 0;
  else
    return 1;
}
int solve(int x, int y) {
  int yy = min(y + k - 1, n - 1);
  int ret = 0;
  for (; yy >= y; yy--) {
    if (checkH(x, yy - k + 1, yy)) {
      ret++;
    }
  }
  int xx = min(x + k - 1, n - 1);
  for (; xx >= x; xx--) {
    if (checkV(y, xx - k + 1, xx)) {
      ret++;
    }
  }
  return ret;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> g[i];
  }
  for (int i = 0; i < n; i++) {
    accH[i][0] = (g[i][0] == '#');
    for (int j = 1; j < n; j++) {
      accH[i][j] = accH[i][j - 1] + (g[i][j] == '#');
    }
  }
  for (int i = 0; i < n; i++) {
    accV[0][i] = (g[0][i] == '#');
    for (int j = 1; j < n; j++) {
      accV[j][i] = accV[j - 1][i] + (g[j][i] == '#');
    }
  }
  int ansN = 1, ansM = 1;
  int mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int curMax = solve(i, j);
      if (mx < curMax) {
        ansN = i + 1;
        ansM = j + 1;
        mx = curMax;
      }
    }
  }
  cout << ansN << " " << ansM << endl;
  return 0;
}
