#include <cstdio>
#include <algorithm>
using namespace std;
int m, n, r, c, i, j, sub[20], l, s, nrels, s_tmp ,smax=-1, mat[8000][17], tmp, st, sln[7400], sl[7400];
int main()
{
    freopen("elimin.in", "r", stdin);
    freopen("elimin.out", "w", stdout);
    scanf("%d%d%d%d", &m, &n, &r, &c);
    if (m>=n) {
        for (i=1; i<=m; i++)
            for (j=1; j<=n; j++)
            {
                scanf("%d", &mat[i][j]);
                sln[i]+=mat[i][j];
                st+=mat[i][j];
            }
    }
    else {
        for (i=1; i<=m; i++)
            for (j=1; j<=n; j++)
            {
                scanf("%d", &mat[j][i]);
                sln[j]+=mat[j][i];
                st+=mat[i][j];
            }
        tmp=m;m=n;n=tmp;
        tmp=r;r=c;c=tmp;
    }
    if (r==0 && c==0) {
            printf("%d", st);
            return 0;
    }
    if (c==0) {
            sort(sln+1, sln+m+1);
            for (i=r+1; i<=m; i++)
                s+=sln[i];
            printf("%d", s);
            return 0;
    }
    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) {
            for (j=1, nrels=0; j<=n; j++) if (sub[j]==1) nrels++;
            if (nrels == c) {
                for (i=1; i<=m; i++) {
                    s=0;
                    for (j=1; j<=n; j++)
                        if (sub[j]==1)
                            s+=mat[i][j];
                    sl[i]=sln[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;
            }
        }
    }
    printf("%d", smax);
    return 0;
}