#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<vector<char>> A;
  vector<vector<long long>> B;
  B.resize(n, vector<long long>(n));
  A.resize(n, vector<char>(n));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> A[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (A[i][j] != '.') {
        continue;
      }
      long long p = 0;
      for (int w = j; w < n; w++) {
        if (A[i][w] == '.') {
          p++;
        } else {
          break;
        }
      }
      if (p >= k) {
        p = 0;
        for (int w = j; w < n; w++) {
          if (A[i][w] == '.') {
            p++;
            B[i][w]++;
            if (p == k) {
              break;
            }
          } else {
            break;
          }
        }
      }
      p = 0;
      for (int w = j; w >= 0; w--) {
        if (A[i][w] == '.') {
          p++;
          if (p == k) {
            break;
          }
        } else {
          break;
        }
      }
      if (p >= k) {
        p = 0;
        for (int w = j; w >= 0; w--) {
          if (A[i][w] == '.') {
            B[i][w]++;
            p++;
            if (p == k) {
              break;
            }
          } else {
            break;
          }
        }
      }
      p = 0;
      for (int w = i; w < n; w++) {
        if (A[w][j] == '.') {
          p++;
          if (p == k) {
            break;
          }
        } else {
          break;
        }
      }
      if (p >= k) {
        p = 0;
        for (int w = i; w < n; w++) {
          if (A[w][j] == '.') {
            B[w][j]++;
            p++;
            if (p == k) {
              break;
            }
          } else {
            break;
          }
        }
      }
      p = 0;
      for (int w = i; w >= 0; w--) {
        if (A[w][j] == '.') {
          p++;
          if (p == k) {
            break;
          }
        } else {
          break;
        }
      }
      if (p >= k) {
        p = 0;
        for (int w = i; w >= 0; w--) {
          if (A[w][j] == '.') {
            B[w][j]++;
            p++;
            if (p == k) {
              break;
            }
          } else {
            break;
          }
        }
      }
    }
  }
  long long ans = 0;
  long long x = 0, y = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (ans < B[i][j]) {
        ans = B[i][j];
        x = i;
        y = j;
      }
    }
  }
  cout << x + 1 << " " << y + 1;
}
