#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(kbrni,n)cout<<" "<<a[kbrni];cout<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define svecp(v) cout<<#v<<":";each(kbrni,v)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 205;

int h,w,n;

int a[MAX_N][MAX_N];
int tmp[MAX_N][MAX_N];
int sm[MAX_N][MAX_N];

int cal(int ul,int dr,int dl,int ur)
{
    return sm[dl+1][ur+1]-sm[dl+1][dr]-sm[ul][ur+1]+sm[ul][dr];
}

void rot(int h,int w)
{
    rep(i,h){
        rep(j,w){
            tmp[i][j] = a[i][j];
        }
    }
    rep(i,w){
        rep(j,h){
            a[i][j] = tmp[j][w-1-i];
        }
    }
}

void sym(int h,int w){
    rep(i,h){
        rep(j,w){
            tmp[i][j] = a[i][j];
        }
    }
    rep(i,h){
        rep(j,w){
            a[i][j] = tmp[i][w-1-j];
        }
    }
}

void calcsum(int h,int w)
{
    rep(i,h+1){
        rep(j,w+1){
            sm[i][j] = 0;
        }
    }
    rep(i,h){
        rep(j,w){
            sm[i+1][j+1] = sm[i+1][j] + a[i][j];
        }
    }
    rep(j,w+1){
        rep(i,h){
            sm[i+1][j] += sm[i][j];
        }
    }
}

int solve(int h,int w,int n,int kind)
{
    calcsum(h,w);
    int mx = -1;
    if(n == 4){
        rep(i,w-1){
            rep(j,h-1){
                rep(k,h-1){
                    cmx(mx,min({cal(0,0,j,i),cal(j+1,0,h-1,i),cal(0,i+1,k,w-1),cal(k+1,i+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            srep(j,i+1,w-1){
                rep(k,h-1){
                    cmx(mx,min({cal(0,0,h-1,i),cal(0,i+1,k,j),cal(k+1,i+1,h-1,j),cal(0,j+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-1){
            rep(j,h-2){
                srep(k,j+1,h-1){
                    cmx(mx,min({cal(0,0,j,i),cal(j+1,0,k,i),cal(k+1,0,h-1,i),cal(0,i+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            srep(j,i+1,w-1){
                rep(k,h-1){
                    cmx(mx,min({cal(0,0,k,i),cal(k+1,0,h-1,i),cal(0,i+1,h-1,j),cal(0,j+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            rep(j,h-1){
                srep(k,i+1,w-1){
                    cmx(mx,min({cal(0,0,j,k),cal(j+1,0,h-1,i),cal(j+1,i+1,h-1,k),cal(0,k+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            rep(j,h-1){
                srep(k,i+1,w-1){
                    cmx(mx,min({cal(0,0,j,i),cal(0,i+1,j,k),cal(j+1,0,h-1,k),cal(0,k+1,h-1,w-1)}));
                }
            }
        }
        if(kind == 0){
            rep(i,w-2){
                srep(j,i+1,w-1){
                    rep(k,h-2){
                        srep(l,k+1,h-1){
                            cmx(mx,min({cal(0,0,l,i),cal(l+1,0,h-1,j),cal(0,i+1,k,w-1),cal(k+1,j+1,h-1,w-1)}));
                        }
                    }
                }
            }
        }
        sym(h,w);
        calcsum(h,w);
        rep(i,w-1){
            rep(j,h-2){
                srep(k,j+1,h-1){
                    cmx(mx,min({cal(0,0,j,i),cal(j+1,0,k,i),cal(k+1,0,h-1,i),cal(0,i+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            srep(j,i+1,w-1){
                rep(k,h-1){
                    cmx(mx,min({cal(0,0,k,i),cal(k+1,0,h-1,i),cal(0,i+1,h-1,j),cal(0,j+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-3){
            srep(j,i+1,w-2){
                srep(k,j+1,w-1){
                    cmx(mx,min({cal(0,0,h-1,i),cal(0,i+1,h-1,j),cal(0,j+1,h-1,k),cal(0,k+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            rep(j,h-1){
                srep(k,i+1,w-1){
                    cmx(mx,min({cal(0,0,j,k),cal(j+1,0,h-1,i),cal(j+1,i+1,h-1,k),cal(0,k+1,h-1,w-1)}));
                }
            }
        }
        rep(i,w-2){
            rep(j,h-1){
                srep(k,i+1,w-1){
                    cmx(mx,min({cal(0,0,j,i),cal(0,i+1,j,k),cal(j+1,0,h-1,k),cal(0,k+1,h-1,w-1)}));
                }
            }
        }
        if(kind == 0){
            rep(i,w-2){
                srep(j,i+1,w-1){
                    rep(k,h-2){
                        srep(l,k+1,h-1){
                            cmx(mx,min({cal(0,0,l,i),cal(l+1,0,h-1,j),cal(0,i+1,k,w-1),cal(k+1,j+1,h-1,w-1)}));
                        }
                    }
                }
            }
        }
    }else if(n == 3){
        rep(i,w-1){
            rep(j,h-1){
                cmx(mx,min({cal(0,0,j,i),cal(j+1,0,h-1,i),cal(0,i+1,h-1,w-1)}));
            }
        }
        sym(h,w);
        calcsum(h,w);
        rep(i,w-1){
            rep(j,h-1){
                cmx(mx,min({cal(0,0,j,i),cal(j+1,0,h-1,i),cal(0,i+1,h-1,w-1)}));
            }
        }
        rep(i,w-2){
            srep(j,i+1,w-1){
                cmx(mx,min({cal(0,0,h-1,i),cal(0,i+1,h-1,j),cal(0,j+1,h-1,w-1)}));
            }
        }
    }else{
        rep(i,w-1){
            cmx(mx,min(cal(0,0,h-1,i),cal(0,i+1,h-1,w-1)));
        }
    }
    return mx;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> h >> w >> n;
    rep(i,h){
        rep(j,w){
            cin >> a[i][j];
        }
    }
    int r1 = solve(h,w,n,0);
    rot(h,w);
    swap(h,w);
    int r2 = solve(h,w,n,1);
    cout << max(r1,r2) << "\n";
    return 0;
}



Measured memory_bytes: 3692