#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k, l, r, u, d, x, maxm = 0;
  long long flagl, flagr, flagd, flagu;
  long long v, h, ansi = -1, ansj;
  cin >> n >> k;
  string s[n];
  for (long long i = 0; i < n; i++) cin >> s[i];
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (s[i][j] == '.') {
        if (k == 1) cout << i + 1 << " " << j + 1, exit(0);
        l = r = u = d = 0;
        flagl = flagr = flagu = flagd = 0;
        x = 1;
        while (x < k) {
          if ((i + x < n) && flagr == 0) {
            if (s[i + x][j] == '.')
              r++;
            else
              flagr = 1;
          }
          if ((i - x > -1) && flagl == 0) {
            if (s[i - x][j] == '.')
              l++;
            else
              flagl = 1;
          }
          if ((j + x < n) && flagd == 0) {
            if (s[i][j + x] == '.')
              d++;
            else
              flagd = 1;
          }
          if ((j - x > -1) && flagu == 0) {
            if (s[i][j - x] == '.')
              u++;
            else
              flagu = 1;
          }
          x++;
        }
        v = max(u + d + 2 - k, (long long)0);
        h = max(l + r + 2 - k, (long long)0);
        if (v + h > maxm) {
          maxm = v + h;
          ansi = i + 1;
          ansj = j + 1;
        }
      }
    }
  }
  if (ansi == -1) cout << "1 1", exit(0);
  cout << ansi << " " << ansj;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long test;
  test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
