#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 1e5;
const long long inf = 10000000;
inline bool EL(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long& a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long modMul(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long modAdd(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long modSub(long long a, long long b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, MOD - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
void dfs() {}
bool cmp() {}
void solve() {}
clock_t b = clock();
string check() {
  clock_t e = clock();
  double t = (e - b) / CLOCKS_PER_SEC;
  return !(t <= (double)1e8) ? "FUCK" : "YAAAH";
}
int f[105][105];
int fr[105][105];
int main() {
  long long n, k;
  scanf("%lld %lld", &n, &k);
  bool flg;
  char c;
  long long x = 0, y = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> c;
      if (c == '.') {
        f[i][j] = 1;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (f[i][j]) {
        if (i + k <= n) {
          flg = 1;
          for (int L = i + 1; L < i + k; L++) {
            if (!f[L][j]) {
              flg = false;
              break;
            }
          }
          if (flg) {
            for (int L = i; L < i + k; L++) {
              fr[L][j]++;
            }
          }
        }
        if (j + k <= n) {
          flg = 1;
          for (int L = j + 1; L < j + k; L++) {
            if (!f[i][L]) {
              flg = false;
              break;
            }
          }
          if (flg) {
            for (int L = j; L < j + k; L++) {
              fr[i][L]++;
            }
          }
        }
        if (fr[i][j] > fr[x][y]) {
          x = i;
          y = j;
        }
      }
    }
  }
  cout << x + 1 << " " << y + 1 << endl;
  return 0;
}
