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

using namespace std;

const int Nmax = 1000;

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

inline void scan( int &n )
{
    n = 0;

    int ch = getchar();
    int sign = 1;

    while ( ch < '0' || ch > '9' )
    {
        if ( ch == '-')
            sign = -1;

        ch = getchar();
    }

    while (  ch >= '0' && ch <= '9' )
    {
        n = ( n << 3 ) + ( n << 1) + ch - '0';
        ch = getchar();
    }

    n = n * sign;
}

void read()
{
    freopen("elimin.in", "r", stdin);

    scan( N );
    scan( M );
    scan( R );
    scan( C );

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

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

    fclose( stdin );
}

void solve( int numar )
{
    int cont = 0;
    int suma = 0;

    for ( int i = 1; i <= N; ++i )
    {
        cont++;
        randuri[i] = 0;

        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 = 0; 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()
{
    freopen("elimin.out", "w", stdout);

    printf("%d\n", sum_max);

    fclose( stdout );
}

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

    return 0;
}