#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<string> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  int ax = 0, ay = 0;
  int ans = 0;
  int left[n][n], right[n][n], up[n][n], down[n][n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int t0, t1, t2, t3, temp;
      t0 = t1 = t2 = t3 = 0;
      if (v[i][j] == '.') {
        temp = j - 1;
        while (temp >= 0 && v[i][temp] == '.') temp--, t0++;
        temp = i - 1;
        while (temp >= 0 && v[temp][j] == '.') temp--, t2++;
        temp = j + 1;
        while (temp < n && v[i][temp] == '.') temp++, t1++;
        temp = i + 1;
        while (temp < n && v[temp][j] == '.') temp++, t3++;
      }
      left[i][j] = t0;
      right[i][j] = t1;
      up[i][j] = t2;
      down[i][j] = t3;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int temp = 0;
      if (right[i][j] + left[i][j] + 1 - k + 1 > 0)
        temp += min(right[i][j] + left[i][j] + 1 - k + 1,
                    min(left[i][j], right[i][j]) + 1);
      if (up[i][j] + down[i][j] + 1 - k + 1 > 0)
        temp += min(up[i][j] + down[i][j] + 1 - k + 1,
                    min(up[i][j], down[i][j]) + 1);
      if (v[i][j] == '.' && temp > ans) {
        ans = temp;
        ax = i;
        ay = j;
      }
    }
  }
  cout << ax + 1 << ' ' << ay + 1 << endl;
  return 0;
}
