program teren;
var f,g:text;
        a:array[0..301,0..301] of longint;
        m,n,x:longint;


procedure citire;
var i,j,y:longint;
begin
        assign(f,'teren.in');reset(f);
        assign(g,'teren.out');rewrite(g);
        readln(f,m,n,x);
        fillchar(a,sizeof(a),0);
        for i:=1 to m do
                for j:=1 to n do
                        begin
                                read(f,y);
                                a[i,j]:=y+a[i-1,j]+a[i,j-1]-a[i-1,j-1]
                        end;
        close(f);
end;

function cbin(p,u,col,target,minus:longint):longint;
var m:longint;
begin
        if p>u then
                cbin:=0 else
        begin
                m:=(p+u) div 2;
                if a[m,col]-a[m,minus]<target then
                        cbin:=cbin(m+1,u,col,target,minus) else
                        if a[m-1,col]-a[m-1,minus]<target then
                                cbin:=m else
                                        cbin:=cbin(p,m-1,col,target,minus);
        end;
end;



procedure prel;
var i,j,max,k,l,ar,arie:longint;
begin
        max:=0;
        for i:=1 to m do
                for j:=1 to n do
                        for k:=0 to j-1 do
                                begin
                                        arie:=a[i,j]-a[i,k];
                                        if x>=arie then l:=0 else
                                                l:=cbin(1,i,j,arie-x,k);
                                        ar:=(j-k)*(i-l);
                                        if ar>max then max:=ar;
                                end;
        writeln(g,max);
        close(g);
end;


begin
        citire;
        prel;
end.