#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

const int Nmax = 1000;

int N, M, R, C, sum_max = -1e8;
int A[Nmax][Nmax];

void read()
{
    ifstream f("elimin.in");

    f >> N >> M >> R >> C;

    if ( N <= M )
    {
        for ( int i = 1; i <= N; ++i )
                for ( int j = 1; j <= M; ++j )
                        f >> A[i][j];
    }
    else
    {
        for ( int i = 1; i <= M; ++i )
                for ( int j = 1; j <= N; ++j )
                        f >> A[j][i];

        swap( N, M );
        swap( R, C );
    }

    f.close();
}

void solve( int numar )
{
    int randuri[Nmax] = { 0 };
    int cont = 0;
    int suma = 0;

    for ( int i = 1; i <= N; ++i )
    {
        cont++;

        for ( int j = 1; j <= M; ++j )
        {
            if ( numar & ( 1 << ( j - 1 ) ) ) continue;

            randuri[cont] += A[i][j];
        }
    }

    sort( randuri + 1, randuri + 1 + cont );

    for ( int i = cont; i >= R + 1; i-- )
    {
        suma += randuri[i];
    }

    sum_max = max( suma, sum_max );
}

void back()
{
    int lim = 1 << M;

    for ( int i = 1; i < lim; ++i )
    {
        int s = 0;

        for ( int j = 0; j < M; ++j )
        {
            if ( i & ( 1 << j ) )
                    s++;
        }

        if ( s == C )
        {
            solve( i );
        }
    }
}

void print()
{
    ofstream g("elimin.out");

    g << sum_max << "\n";

    g.close();
}

int main()
{
    read();
    back();
    print();

    return 0;
}