#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000000001;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  pair<int, int> result = {1, 1};
  char M[n + 2][n + 2];
  int counter[n + 2][n + 2];
  for (int i = 0; i < (n + 2); i++)
    M[0][i] = M[i][0] = M[n + 1][i] = M[i][n + 1] = '#';
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (n + 1); j++) cin >> M[i][j];
  int best = 0;
  for (int i = 0; i < (n + 2); i++)
    for (int j = 0; j < (n + 2); j++) counter[i][j] = 0;
  for (int i = (1); i < (n + 1); i++) {
    for (int j = (1); j < (n + 1); j++) {
      char c = M[i][j];
      if (c != '#') {
        int jj = j;
        int ii = i;
        int up = 0;
        while (M[i][jj - 1] != '#') {
          up++;
          jj--;
        }
        jj = j;
        int down = 0;
        while (M[i][jj + 1] != '#') {
          down++;
          jj++;
        }
        int right = 0;
        while (M[ii + 1][j] != '#') {
          right++;
          ii++;
        }
        ii = i;
        int left = 0;
        while (M[ii - 1][j] != '#') {
          left++;
          ii--;
        }
        if (up + down + 1 >= k) {
          int k_up = min(k - 1, up);
          int k_down = min(k - 1, down);
          counter[i][j] += k_up + k_down + 1 - k + 1;
        }
        if (left + right + 1 >= k) {
          int k_left = min(k - 1, left);
          int k_right = min(k - 1, right);
          counter[i][j] += k_left + k_right + 1 - k + 1;
        }
      }
      if (best < counter[i][j]) {
        best = counter[i][j];
        result = {i, j};
      };
    }
  }
  cout << result.first << " " << result.second << endl;
  return 0;
}
