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

using namespace std;
int v[20],s[8000],ans=0,n,m,r,c;
vector <int> mat[8000];
void solve(){
    int i,j;
    for(i=1;i<=m;i++){
        s[i]=0;
        for(j=1;j<=n;++j){
            if(v[j]==0)
               s[i]+=mat[i][j];
        }
    }
    sort(s+1, s+m+1);
    int sum = 0;
    for(i = c+1; i<=m; ++i)
        sum += s[i];
    ans = max(ans, sum);
}
void backt(int cnt,int x){
    if(x==n+1){
        if(cnt==r){
           solve();
        }
        return;
    }
    if(cnt > r)
        return;
    v[x] = 1;
    backt(cnt+1, x+1);
    v[x] = 0;
    backt(cnt, x+1);
}
int main()
{
    int i,j;
    ifstream cin("elimin.in");
    ofstream cout("elimin.out");
    cin >> n >> m >> r >> c;
    for(i = 1; i<=n; i++)
    {
        mat[i].resize(m+1);
        for(j = 1; j<=m; j++)
            cin >> mat[i][j];
    }
    backt(0,1);
    cout << ans << "\n";
    return 0;
}