#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, i, j, maxm = -1, x, p, q;
  cin >> n >> k;
  string s;
  vector<string> v;
  for (i = 0; i < n; i++) {
    cin >> s;
    v.push_back(s);
  }
  int l[n][n], r[n][n], u[n][n], d[n][n];
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (j == 0) {
        if (v[i][j] == '.')
          l[i][j] = 1;
        else
          l[i][j] = 0;
        if (v[i][n - 1 - j] == '.')
          r[i][n - 1 - j] = 1;
        else
          r[i][n - 1 - j] = 0;
        if (v[j][i] == '.')
          u[j][i] = 1;
        else
          u[j][i] = 0;
        if (v[n - 1 - j][i] == '.')
          d[n - 1 - j][i] = 1;
        else
          d[n - 1 - j][i] = 0;
      } else {
        if (v[i][j] == '.') {
          l[i][j] = 1 + l[i][j - 1];
          l[i][j] = min(k, l[i][j]);
        } else
          l[i][j] = 0;
        if (v[i][n - 1 - j] == '.') {
          r[i][n - 1 - j] = 1 + r[i][n - j];
          r[i][n - 1 - j] = min(k, r[i][n - 1 - j]);
        } else
          r[i][n - 1 - j] = 0;
        if (v[j][i] == '.') {
          u[j][i] = 1 + u[j - 1][i];
          u[j][i] = min(k, u[j][i]);
        } else
          u[j][i] = 0;
        if (v[n - 1 - j][i] == '.') {
          d[n - 1 - j][i] = 1 + d[n - j][i];
          d[n - 1 - j][i] = min(k, d[n - 1 - j][i]);
        } else
          d[n - 1 - j][i] = 0;
      }
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      x = min(k, max(0, l[i][j] + r[i][j] - k)) +
          min(k, max(0, d[i][j] + u[i][j] - k));
      if (x > maxm) {
        maxm = x;
        p = i + 1;
        q = j + 1;
      }
    }
  }
  cout << p << " " << q;
  return 0;
}
