#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC tsmthget("avx2")
using namespace std;
const int one = 1;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int N = 2e5;
const int nul = 0;
vector<string> smth;
int n;
bool g(int i, int j) {
  if (i >= 0 && i < n && j >= 0 && j < n) return 1;
  return 0;
}
int f(int i, int j, int di, int dj) {
  int ans = 0;
  while (g(i + di, j + dj) && smth[i + di][j + dj] == '.') {
    ans++;
    i += di;
    j += dj;
  }
  return ans;
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  int k;
  cin >> n >> k;
  smth.resize(n);
  for (auto &i : smth) cin >> i;
  vector<vector<int> > left, right, up, down;
  left = right = up = down = vector<vector<int> >(n, vector<int>(n, 0));
  int ans = 0;
  int ansi = 0, ansj = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (smth[i][j] == '.') {
        ansi = i;
        ansj = j;
        left[i][j] = f(i, j, 0, -1);
        right[i][j] = f(i, j, 0, 1);
        down[i][j] = f(i, j, 1, 0);
        up[i][j] = f(i, j, -1, 0);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int res = 0;
      for (int k1 = 0; k1 < k; k1++) {
        if (smth[i][j] == '.') {
          if (left[i][j] >= k1 && right[i][j] >= k - k1 - 1) res++;
          if (right[i][j] >= k1 && left[i][j] >= k - k1 - 1) res++;
          if (down[i][j] >= k1 && up[i][j] >= k - k1 - 1) res++;
          if (up[i][j] >= k1 && down[i][j] >= k - k1 - 1) res++;
          if (res > ans) {
            ans = res;
            ansi = i;
            ansj = j;
          }
        }
      }
    }
  }
  cout << ansi + 1 << " " << ansj + 1 << endl;
}
