#include <bits/stdc++.h>
using namespace std;
void run() {}
int fixMod(int a, int b) { return ((a % b) + b) % b; }
void fast() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  fast();
  run();
  int n, k;
  cin >> n >> k;
  vector<vector<char>> v(n, vector<char>(n));
  vector<vector<int>> col(n + 5, vector<int>(n + 5)),
      res(n + 5, vector<int>(n + 5)), row(n + 5, vector<int>(n + 5));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> v[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      bool flag = 1;
      for (int h = 0; h < k && j + k <= n; h++) {
        if (v[i][h + j] == '#') {
          flag = 0;
          break;
        }
      }
      if (flag && j + k <= n) {
        col[i][j]++;
        col[i][j + k + 1]--;
      }
      flag = 1;
      for (int h = 0; h < k && i + k <= n; h++) {
        if (v[i + h][j] == '#') {
          flag = 0;
          break;
        }
      }
      if (flag && i + k <= n) {
        row[i][j]++;
        row[i + k + 1][j]--;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 1; j < n; j++) {
      col[i][j] += col[i][j - 1];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 1; j < n; j++) {
      row[j][i] += row[j - 1][i];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      res[i][j] = col[i][j] + row[i][j];
    }
  }
  int ansy, ansx, mx = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (res[i][j] > mx) {
        ansx = i + 1;
        ansy = j + 1;
        mx = res[i][j];
      }
    }
  }
  cout << ansx << " " << ansy << "\n";
  return 0;
}
