#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elimin.in");
ofstream g("elimin.out");
int n,m,r,c,s;
bool vizx[8000],vizy[8000];
struct suma{
    int val,poz;
}sum[8000],sumc[8000];
bool cmp(suma A,suma B){
    return A.val<B.val;
}
int main()
{
    f>>n>>m>>r>>c;
    short a[n+5][m+5];
    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j){
            f>>a[i][j];
            sum[i].val+=a[i][j];
            sum[i].poz=i;
        }
    }
    sort(sum+1,sum+n+1,cmp);
    for(int i=1;i<=r;++i){
        vizx[sum[i].poz]=1;
    }
    for(int i=1;i<=m;++i){
        for(int j=1;j<=n;++j){
            if(vizx[j]==0){
                sumc[i].val+=a[i][j];
                sumc[i].poz=i;
            }
        }
    }
    sort(sumc+1,sumc+n+1,cmp);
    for(int i=1;i<=r;++i){
        vizy[sumc[i].poz]=1;
    }
    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j){
            if(vizx[i]+vizy[j]==0){
                s+=a[i][j];
            }
        }
    }
    g<<s;
}