#include <bits/stdc++.h>
using namespace std;
int up[105][105];
int down[105][105];
int lft[105][105];
int rgt[105][105];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int k, n;
  cin >> n >> k;
  string graph[105];
  for (int i = 0; i < n; i++) cin >> graph[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i) up[i][j] = up[i - 1][j];
      if (j) lft[i][j] = lft[i][j - 1];
      if (graph[i][j] == '#') {
        up[i][j] = lft[i][j] = 0;
      } else {
        up[i][j]++;
        lft[i][j]++;
      }
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    for (int j = n - 1; j >= 0; j--) {
      if (i < n - 1) down[i][j] = down[i + 1][j];
      if (j < n - 1) rgt[i][j] = rgt[i][j + 1];
      if (graph[i][j] == '#') {
        down[i][j] = rgt[i][j] = 0;
      } else {
        down[i][j]++;
        rgt[i][j]++;
      }
    }
  }
  int ans = 0, ansi, ansj, t, t1, t2;
  ansi = 0;
  ansj = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (lft[i][j] + rgt[i][j] - 1 < k)
        t1 = 0;
      else
        t1 = (min(lft[i][j], k) + min(rgt[i][j], k)) - k;
      t1 = min(k, t1);
      if (up[i][j] + down[i][j] - 1 < k)
        t2 = 0;
      else
        t2 = (min(up[i][j], k) + min(k, down[i][j])) - k;
      t2 = min(k, t2);
      t = t1 + t2;
      if (t > ans) {
        ans = t;
        ansi = i;
        ansj = j;
      }
    }
  }
  cout << ansi + 1 << " " << ansj + 1 << "\n";
  return 0;
}
