#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elimin.in");
ofstream g("elimin.out");
int m, n, r, c, i, j, sub[16], l, spl[550], sl[550], s, nrels, s_tmp ,smax=-1;
short int mat[521][16];
int main()
{
    f>>m>>n>>r>>c;
    for (i=1; i<=m; i++)
        for (j=1; j<=n; j++)
        {
            f>>mat[i][j];
            spl[i]+=mat[i][j];
        }
    if (m>=n) {
        while (sub[n+1]==0) {
            l=1;
            while (sub[l]==1) {
                sub[l]=0;
                l++;
            }
            sub[l]=1;
            s_tmp=0;
            if (sub[n+1]==0) {
                nrels=0;
                for (i=1; i<=m; i++) {
                    s=0;
                    for (j=1; j<=n; j++) {
                        if (sub[j]==1) {
                            s+=mat[i][j];
                            nrels++;
                        }
                    }
                    if (nrels<c)
                        break;
                    sl[i]=spl[i]-s;
                }
                sort(sl+1, sl+m+1);
                for (i=r+1; i<=m; i++)
                    s_tmp+=sl[i];
                if (s_tmp > smax)
                    smax=s_tmp;
            }
        }
    }
    else {
        while (sub[m+1]==0) {
            l=1;
            while (sub[l]==1) {
                sub[l]=0;
                l++;
            }
            sub[l]=1;
            s_tmp=0;
            if (sub[m+1]==0) {
                nrels=0;
                for (i=1; i<=n; i++) {
                    s=0;
                    for (j=1; j<=m; j++) {
                        if (sub[j]==1) {
                            s+=mat[i][j];
                            nrels++;
                        }
                    }
                    if (nrels<r)
                        break;
                    sl[i]=spl[i]-s;
                }
                sort(sl+1, sl+n+1);
                for (i=c+1; i<=n; i++)
                    s_tmp+=sl[i];
                if (s_tmp > smax)
                    smax=s_tmp;
            }
        }
    }
    g<<smax;
    return 0;
}