#include <bits/stdc++.h>
using namespace std;
char grid[150][150];
int n, k;
int dis[150][150];
void dfs(int sx, int sy) {
  long long cnt = 0;
  for (int i = sx; i >= max(0, sx - (k - 1)); i--) {
    if (grid[i][sy] == '#') break;
    cnt++;
  }
  for (int i = sx + 1; i <= min(n - 1, sx + (k - 1)); i++) {
    if (grid[i][sy] == '#') break;
    cnt++;
  }
  if (cnt >= k) {
    dis[sx][sy]++;
    cnt -= k;
  } else
    cnt = 0;
  dis[sx][sy] += cnt;
  cnt = 0;
  for (int i = sy; i >= max(0, sy - (k - 1)); i--) {
    if (grid[sx][i] == '#') break;
    cnt++;
  }
  for (int i = sy + 1; i <= min(n - 1, sy + (k - 1)); i++) {
    if (grid[sx][i] == '#') break;
    cnt++;
  }
  if (cnt >= k) {
    dis[sx][sy]++;
    cnt -= k;
  } else
    cnt = 0;
  dis[sx][sy] += cnt;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> grid[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (grid[i][j] == '.') {
        dfs(i, j);
      }
    }
  }
  long long x = 0, y = 0, mx = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (mx < dis[i][j]) {
        x = i, y = j;
        mx = dis[i][j];
      }
    }
  }
  cout << x + 1 << " " << y + 1 << "\n";
}
