#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<vector<char> > field(n + 10, vector<char>(n + 10));
  vector<vector<int> > ans(n + 10, vector<int>(n + 10, 0));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> field[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (field[i][j] == '.') {
        int cnt = 0;
        for (int cur = i; cur > -1; cur--) {
          if (field[cur][j] == '#' || i - cur == k) {
            break;
          } else {
            cnt++;
          }
        }
        for (int cur = i; cur < n; cur++) {
          if (field[cur][j] == '#' || cur - i == k) {
            break;
          } else {
            cnt++;
          }
        }
        cnt--;
        if (cnt >= k) {
          ans[i][j] += cnt - k + 1;
        }
        cnt = 0;
        for (int cur = j; cur > -1; cur--) {
          if (field[i][cur] == '#' || j - cur == k) {
            break;
          } else {
            cnt++;
          }
        }
        for (int cur = j; cur < n; cur++) {
          if (field[i][cur] == '#' || cur - j == k) {
            break;
          } else {
            cnt++;
          }
        }
        cnt--;
        if (cnt >= k) {
          ans[i][j] += cnt - k + 1;
        }
      }
    }
  }
  int maxs = -1;
  int x = 0;
  int y = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (ans[i][j] > maxs) {
        maxs = ans[i][j];
        x = i;
        y = j;
      }
    }
  }
  cout << x + 1 << " " << y + 1;
  return 0;
}
