#include <bits/stdc++.h>
using namespace std;
const int N = 105;
char mp[N][N];
int n, m;
int cal(int x, int y) {
  if (mp[x][y] != '.') return 0;
  int l, r, ret = 0;
  l = r = x;
  while (mp[l - 1][y] == '.') --l;
  while (mp[r + 1][y] == '.') ++r;
  ret += max(min(r, x + m - 1) - max(l, x - m + 1) + 1 - m + 1, 0);
  l = r = y;
  while (mp[x][l - 1] == '.') --l;
  while (mp[x][r + 1] == '.') ++r;
  ret += max(min(r, y + m - 1) - max(l, y - m + 1) + 1 - m + 1, 0);
  return ret;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) scanf("%s", mp[i] + 1);
  pair<int, int> pii;
  int ans = -1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++)
      if (cal(i, j) > ans) ans = cal(i, j), pii = make_pair(i, j);
  }
  cout << pii.first << ' ' << pii.second << endl;
  return 0;
}
