#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, kk;
  cin >> n >> kk;
  string s[200];
  int dp[200][200];
  for (int i = 0; i < n; i++) cin >> s[i];
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (s[i][j] == '.') {
        int cnt = 0;
        for (int k = i; k < min(n, i + kk); k++) {
          if (s[k][j] == '#')
            break;
          else
            cnt++;
        }
        if (i != 0) {
          for (int k = i - 1; k >= max(0, i - kk + 1); k--) {
            if (s[k][j] == '#')
              break;
            else
              cnt++;
          }
        }
        dp[i][j] += max(0, cnt - kk + 1);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (s[i][j] != '#') {
        int cnt = 0;
        for (int k = j; k < min(n, j + kk); k++) {
          if (s[i][k] == '#')
            break;
          else
            cnt++;
        }
        if (j != 0) {
          for (int k = j - 1; k >= max(0, j - kk + 1); k--) {
            if (s[i][k] == '#')
              break;
            else
              cnt++;
          }
        }
        dp[i][j] += max(0, cnt - kk + 1);
      }
    }
  }
  int ans = -1;
  int x = 0, y = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (dp[i][j] > ans) {
        ans = dp[i][j];
        x = i + 1;
        y = j + 1;
      }
    }
  }
  cout << x << " " << y;
  return 0;
}
