#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("elimin.in");
ofstream g("elimin.out");
vector <int> a[7294];
struct vec
{int sum; int ind;} ;
vec sl[7300],sc[7300];
int n,m,r,c,sol=0;

bool comp(vec x,vec y)
{
  return x.sum<y.sum;
}

void Read()
{ int i,j,el;
    f>>n>>m>>r>>c;

    for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
    {f>>el; sol+=el;
     a[i].push_back(el);
     sl[i].sum+=el; ;
     sc[j].sum+=el;
     }

 for(i=1;i<=n;i++) sl[i].ind=i;
 for(j=1;j<=m;j++) sc[j].ind=j;
}

void Solve()
{ int i,j;
    for(i=1;i<=r;i++)
    {for(j=1;j<=m;j++)
    sc[j].sum-=a[sl[i].ind][j-1];
    sol-=sl[i].sum;
    }
 sort(sc+1,sc+m+1,comp);
  for(i=1;i<=c;i++)
  sol-=sc[i].sum;
  g<<sol;
}
int main()
{ Read();
  sort(sl+1,sl+n+1,comp);
  Solve();
    return 0;
}