#include <cstdio>

#define Nmax 303
#define Mmax 303
#define precizie 1000
#define ll long long

int N, M, R, C, Amax;
int A[Nmax][Mmax];
int S[Nmax][Mmax];
ll v[Mmax];
int i,j;
int Q[Mmax];

void citire()
{
 freopen("balans.in","r",stdin);
 scanf("%d %d %d %d",&N,&M,&R,&C);
 if (R==0) R=1;
 if (C==0) C=1;
 for (i=1; i<=N; ++i)
     for (j=1; j<=M; ++j)
        {
         scanf("%d", &A[i][j]);
         A[i][M+j] = A[i+N][j] = A[i+N][j+M] = A[i][j];
         Amax = Amax > A[i][j] ? Amax : A[i][j];
        }
}

void compute()
{
 for (i=1; i<=2*N; ++i)
     for (j=1; j<=2*M; ++j)
         S[i][j] = S[i-1][j] + A[i][j];
}

int exista(int V)
{
 int st,dr,k;
 ll dif;
 for (i=0; i<=N-1; ++i)
     for (j=i+R; j<=i+N; ++j)
         {
          dif = (ll) V*(j-i);
          for (k=1; k<=2*M; ++k)
              v[k] = v[k-1] + (ll) (S[j][k] - S[i][k]) * precizie - dif;
          Q[st=dr=1]=0;
          dr=0;
          if (v[C]>=0) return 1;
          for (k=C+1; k<2*M && Q[st]<=M; ++k)
                {
                 while (st<dr && Q[st] < k-M) ++st;
                 Q[++dr] = k-C;
                 while (dr>st && v[Q[dr]] < v[Q[dr-1]])
                        {
                         Q[dr-1]=Q[dr];
                         --dr;
                        }
                 if (v[k] >= v[Q[st]]) return 1;
                }
         }
 return 0;
}

void cauta()
{
 int p=1, nr=0;
 Amax *= precizie;
 while ((p << 1)<=Amax) p<<=1;
 while (p)
       {
        if (exista(nr+p)) nr+=p;
        p>>=1;
        while (nr+p>Amax) p>>=1;
       }
 printf("%d.%03d\n",nr/1000,nr%1000);
}

int main()
{
 citire();
 compute();
 freopen("balans.out","w",stdout);
 cauta();
 fclose(stdout);
 return 0;
}