#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
const int mo[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};
char s[maxn][maxn];
int ans, sum;
int n, m;
int dfs(int x, int y, int cnt, int der) {
  if (cnt == m) return cnt;
  int fx = x + mo[der][0];
  int fy = y + mo[der][1];
  if (fx < 0 || fy < 0 || fx >= n || fy >= n) return cnt;
  if (s[fx][fy] == '.') cnt = dfs(fx, fy, ++cnt, der);
  return cnt;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> s[i];
  int x = 0, y = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (s[i][j] == '.') {
        int u = dfs(i, j, 1, 0);
        int d = dfs(i, j, 1, 1);
        int l = dfs(i, j, 1, 2);
        int r = dfs(i, j, 1, 3);
        ans = min(m, max(0, l + r - m)) + min(m, max(0, u + d - m));
        if (ans > sum) {
          sum = ans;
          x = i;
          y = j;
        }
      }
    }
  }
  cout << x + 1 << " " << y + 1 << endl;
  return 0;
}
