var s,bin,st:array[0..30]of integer;
    v:array[0..5000,0..5000]of integer;
    x:array[0..2000]of integer;
    i,j,n,m,r,c,stot,max:longint;

procedure back(k,no:longint);
var i,j,ss,min,nr:longint;
    ok:boolean;
begin
if k=no then
        begin
        nr:=0;
        for i:=1 to no do
                if st[i]=1 then
                        begin
                        inc(nr);
                        s[nr]:=i;
                        end;
        if nr=r then
                begin
                ss:=stot;
                for i:=1 to n do
                        x[i]:=v[0,i];
                for i:=1 to nr do
                        for j:=1 to n do
                                dec(x[j],v[s[i],j]);
                for i:=1 to nr do
                        ss:=ss-v[s[i],0];
                for i:=1 to c do
                        begin
                        min:=1;
                        for j:=2 to n do
                                if x[j]<x[min] then
                                        min:=j;
                        ss:=ss-x[min];
                        x[min]:=maxint;
                        end;
                if ss>max then
                        max:=ss;
                end
        else if nr=c then
                begin
                ss:=stot;
                for i:=1 to m do
                        x[i]:=v[i,0];
                for i:=1 to nr do
                        for j:=1 to m do
                                dec(x[j],v[j,s[i]]);
                for i:=1 to nr do
                        ss:=ss-v[0,s[i]];
                for i:=1 to r do
                        begin
                        min:=1;
                        for j:=2 to m do
                                if x[j]<x[min] then
                                        min:=j;
                        ss:=ss-x[min];
                        x[min]:=maxint;
                        end;
                if ss>max then
                        max:=ss;
                end;
        end
else
        for i:=0 to 1 do
                begin
                st[k+1]:=i;
                back(k+1,no);
                end;
end;

begin
assign(input,'elimin.in');reset(input);
assign(output,'elimin.out');rewrite(output);
readln(m,n,r,c);
for i:=1 to m do
        for j:=1 to n do
                begin
                read(v[i,j]);
                inc(v[i,0],v[i,j]);
                stot:=stot+v[i,j];
                end;
for i:=1 to n do
        for j:=1 to m do
                inc(v[0,i],v[j,i]);
if n<m then
        back(0,n)
else
        back(0,m);
writeln(max);
close(input);close(output);
end.