#include <bits/stdc++.h>
const int N = 105;
using namespace std;
int n, k;
char s[N][N];
int dp[N][N];
void print(int x, int y) {
  printf("%d %d\n", x, y);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) cout << dp[i][j] << ' ';
    puts("");
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (s[i][j] == '#') continue;
      bool f = 1;
      for (int l = 0; l < k; l++)
        if (i + l > n || s[i + l][j] != '.') {
          f = 0;
          break;
        }
      if (f)
        for (int l = 0; l < k; l++) dp[i + l][j]++;
      f = 1;
      for (int l = 0; l < k; l++)
        if (j + l > n || s[i][j + l] != '.') {
          f = 0;
          break;
        }
      if (f && k > 1)
        for (int l = 0; l < k; l++) dp[i][j + l]++;
      ans = max(ans, dp[i][j]);
    }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (dp[i][j] == ans) {
        printf("%d %d\n", i, j);
        return 0;
      }
    }
  return 0;
}
