#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1 << 29;
struct node {
  int l = 0, r = 0, u = 0, d = 0;
};
long long int findit(long long int x, long long int y, long long int k) {
  long long int ans = 0;
  for (long long int i = 0; i <= x; i++) {
    if (i > k) break;
    for (long long int j = 0; j <= y; j++) {
      if (i + j == k) {
        ans++;
      }
      if (i + j >= k) break;
    }
  }
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  long long int n, k;
  cin >> n >> k;
  char c[n][n];
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) {
      cin >> c[i][j];
    }
  }
  node dp[n][n];
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) {
      if (i != 0) {
        if (c[i - 1][j] == '.') dp[i][j].u = dp[i - 1][j].u + 1;
      }
      if (j != 0) {
        if (c[i][j - 1] == '.') dp[i][j].l = dp[i][j - 1].l + 1;
      }
    }
  }
  for (long long int i = n - 1; i >= 0; i--) {
    for (long long int j = n - 1; j >= 0; j--) {
      if (i != n - 1) {
        if (c[i + 1][j] == '.') dp[i][j].d = dp[i + 1][j].d + 1;
      }
      if (j != n - 1) {
        if (c[i][j + 1] == '.') dp[i][j].r = dp[i][j + 1].r + 1;
      }
    }
  }
  long long int ai = 0, aj = 0;
  long long int ans = 0;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) {
      if (c[i][j] == '#') continue;
      long long int v = dp[i][j].d + dp[i][j].u + 1;
      long long int h = dp[i][j].l + dp[i][j].r + 1;
      long long int curr = findit(dp[i][j].d, dp[i][j].u, k - 1) +
                           findit(dp[i][j].l, dp[i][j].r, k - 1);
      if (ans < curr) {
        ans = curr;
        ai = i;
        aj = j;
      }
    }
  }
  cout << ai + 1 << " " << aj + 1;
  return 0;
}
