#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
long long int maxx(long long int a, long long int b) { return a > b ? a : b; }
long long int minn(long long int a, long long int b) { return a > b ? b : a; }
using namespace std;
int dx[] = {1, 1, 1, 0, 0, -1, -1, -1, 0};
int dy[] = {-1, 0, 1, 1, -1, 0, 1, -1, 0};
void boostIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int poww(long long int base, long long int exp) {
  base %= 1000000007;
  long long int result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % 1000000007;
    base = (base * base) % 1000000007;
    exp >>= 1;
  }
  return result;
}
char a[200][200];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cin >> a[i][j];
    }
  }
  int ships = 0, row = 1, col = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[i][j] == '#') continue;
      int vertical_down = 0, horiz_down = 0, vertical_up = 0, horiz_up = 0;
      for (int l = i + 1; l <= n; l++) {
        if (a[l][j] == '#') break;
        vertical_down++;
      }
      for (int l = i - 1; l >= 1; l--) {
        if (a[l][j] == '#') break;
        vertical_up++;
      }
      for (int l = j + 1; l <= n; l++) {
        if (a[i][l] == '#') break;
        horiz_down++;
      }
      for (int l = j - 1; l >= 1; l--) {
        if (a[i][l] == '#') break;
        horiz_up++;
      }
      int counts = 0;
      if (vertical_down + vertical_up + 1 >= k) {
        counts += min(vertical_down + vertical_up + 2 - k,
                      min(k, min(vertical_down, vertical_up) + 1));
      }
      if (horiz_down + horiz_up + 1 >= k) {
        counts += min(horiz_down + horiz_up + 2 - k,
                      min(k, min(horiz_down, horiz_up) + 1));
      }
      if (ships < counts) {
        row = i, col = j;
        ships = counts;
      }
    }
  }
  cout << row << " " << col << endl;
}
