# include <algorithm>
# include <fstream>
using namespace std;
ifstream f("elimin.in");
ofstream g("elimin.out");
int i,j,n,m,N,M,maxx,suma,VV,s[1000];
int ap[100],a[700][50];
void back (int k)
{
    short i,j;
    if (k==m+1)//daca gasim solutie
    {
        if (VV==M)
        {
            for (i=1; i<=n; ++i)
            {
                s[i]=0;
                for (j=1; j<=m; ++j)
                {
                    if (!ap[j]) s[i]+=a[i][j];
                }
            }
            sort (s+1,s+n+1); suma=0;
            for (i=n; i>N; --i)
                suma+= s[i];
            if (suma>maxx) maxx=suma;
        }
    }
    else
    {
        for (i=0; i<=1; ++i)
        {
            if (i==1) ++VV;
            ap[k]=i;
            if (i==0) back(k+1);
               else if (VV<=M) back(k+1);
            if (i==1) --VV;
        }
    }
}
int main ()
{
    f>>n>>m>>N>>M;
    if (n>=m)
    {
        for (i=1; i<=n; ++i)
            for (j=1; j<=m; ++j)
                f>>a[i][j];
    }
    else
    {
        swap(n,m); swap(N,M);
        for (j=1; j<=m; ++j)
            for (i=1; i<=n; ++i)
                f>>a[i][j];
    }
    back (1);
    g<<maxx<<"\n";

    return 0;
}