#include <bits/stdc++.h>
using namespace std;
int n, k;
int t[200][200];
int cuantos[200][200];
bool inside(int i, int j) { return 1 <= i and i <= n and 1 <= j and j <= n; }
bool puede(int i, int j, int di, int dj) {
  for (int s = 0; s < k; s++) {
    int nexti = i + di * s;
    int nextj = j + dj * s;
    if (not inside(nexti, nextj) or t[nexti][nextj] == 0) return false;
  }
  return true;
}
void asigna(int i, int j, int di, int dj) {
  for (int s = 0; s < k; s++) {
    int nexti = i + di * s;
    int nextj = j + dj * s;
    cuantos[nexti][nextj]++;
  }
}
int movi[4] = {0, 1};
int movj[4] = {1, 0};
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      char c;
      cin >> c;
      t[i][j] = c == '.';
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int tope = 2;
      if (k == 1) tope = 1;
      for (int d = 0; d < tope; d++)
        if (puede(i, j, movi[d], movj[d])) asigna(i, j, movi[d], movj[d]);
    }
  }
  int cmax = 0;
  int imax = 1;
  int jmax = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (cuantos[i][j] > cmax) {
        cmax = cuantos[i][j];
        imax = i;
        jmax = j;
      }
    }
  }
  cout << imax << " " << jmax << endl;
}
