/**
  *    author:  NEZZ
 **/
 #include <bits/stdc++.h>
 #define rep(i,a,b) for (int i=a;i<b;i++)
 #define rep2(i,a,b) for (int i=a;i>=b;i--)
 #define mod 1000000007
 #define INF  0x3f3f3f3f3f3f3f3f
 #define f first
 #define s second
 #define endl '\n'
 #define ll long long
 #define ii pair <int,int>
 #define pll pair <ll,ll>
 #define vi vector <int>
 #define vl vector <ll>
 #define vvi vector < vi >
 #define vii vector < ii >
 #define vvii vector < vii>
 #define vll vector < ll >
 #define vb  vector <bool>
 #define pb push_back
 #define mk make_pair
 #define sz(a) a.size()
 #define all(a) a.begin(),a.end()
 #define rall(a) a.rbegin(),a.rend()
 #define input freopen("input","r",stdin)
 #define output freopen("output","w",stdout)
 #define fastIO ios_base::sync_with_stdio (0),cin.tie(0)
 #define debug input,output

 using namespace std;
 void affiche (int t[],int n){ rep (i,0,n) cout<<t[i]<<" ";cout<<endl;}
 void afficheV (vi t){rep (i,0,sz(t))cout<<t[i]<<" ";cout<<endl;}
   int n,k;
   string  s[300];
   int ans[300][300];
   bool valid (int i,int j){
    return i>=0 && i<n && j>=0 && j<n;
   }
   bool hor (int i,int j){
      rep(c,0,k){
        if (!valid (i,j+c) or s[i][j+c]=='#') return false;
      }
      return true;
   }
     bool ver (int i,int j){
      rep(c,0,k){
        if (!valid (i-c,j) or s[i-c][j]=='#') return false;
      }
      return true;
   }
 int main(){
  fastIO;
  cin>>n>>k;
  rep(i,0,n)
    cin>>s[i];
  rep(i,0,n){
    rep(j,0,n){
      if (hor(i,j)){
        rep(c,0,k)
           ans[i][j+c]++;
      }
      if (ver(i,j)){
         rep(c,0,k){
          ans[i-c][j]++;
         }
      }
    }
  }
  int mx=0;
  int iii=0;
  int jjj=0;
   rep(i,0,n){
     rep(j,0,n){
        mx=max(ans[i][j],mx);
        if (ans[i][j]==mx) iii=i,jjj=j;
     }
   }
   cout<<iii+1<<" "<<jjj+1;
 }