#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k, max = -1, row = 0, col = 0;
  cin >> n >> k;
  int l[n][n], a[n][n], count = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) a[i][j] = 0;
  bool prev = false;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      char c;
      cin >> c;
      if (c == '#')
        l[i][j] = 1;
      else if (c == '.')
        l[i][j] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= (n - k); j++) {
      if (j <= (n - k)) {
        bool flag = true;
        if (l[i][j] == 0) {
          for (int v = j; v < (j + k); v++) {
            if (l[i][v] == 1) {
              flag = false;
              break;
            }
          }
          if (flag == true) {
            for (int v = j; v < (j + k); v++) {
              a[i][v] += 1;
            }
          }
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int m = 0; m <= (n - k); m++) {
      bool flag = true;
      if (l[m][i] == 0) {
        for (int v = m; v < (m + k); v++) {
          if (l[v][i] == 1) {
            flag = false;
            break;
          }
        }
        if (flag == true) {
          for (int v = m; v < (m + k); v++) a[v][i] += 1;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int g = 0; g < n; g++) {
      if (a[i][g] > max) {
        row = i + 1;
        col = g + 1;
        max = a[i][g];
      }
    }
  }
  if (max != -1)
    cout << row << " " << col << " " << endl;
  else
    cout << "1 1" << endl;
  return 0;
}
