#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("elimin.in");
ofstream fout("elimin.out");

const int BIGNR=99999999;

int n, m, a[5000][20], l, c, x[30], smax;

void Citire()
{
    fin>>n>>m>>l>>c;
    if(m>n)
    {

        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                fin>>a[j][i];
        swap(m,n);
        swap(c,l);

    }
    else
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                fin>>a[i][j];
    for(int i=1;i<=m;++i)
        for(int j=1;j<=n;++j) a[0][i]+=a[j][i];

}

void Solve()
{
    int aux[5052]={0}, auxs=0;
    for(int i=1;i<=n;++i) aux[i]=a[i][0];// fout<<aux[i]<<" ";
    //fout<<"\n";
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)  aux[i]+=a[i][j];
    sort(aux+1, aux+n+1);
    //for(int i=1;i<=n;++i) fout<<aux[i]<<" ";
    //fout<<"\n";
    for(int i=c+1;i<=m;++i) auxs+=aux[i];
    if(auxs>smax) smax=auxs;
}

void Bk(int k)
{
    if(k==c+1) Solve();
    else
    {
        for(int i=x[k-1]+1;i<=m;++i)
        {
            x[k]=i;
            for(int j=1;j<=n;++j) a[j][0]-=a[j][i];
            Bk(k+1);
            for(int j=1;j<=n;++j) a[j][0]+=a[j][i];
        }
    }
}

int main()
{
    Citire();
    Bk(1);
    fout<<smax<<"\n";
    return 0;
}