#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(false);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

pii dp[33][33][33][33];
signed main() {
    while (1) {
        REP(i, 33) REP(j, 33) REP(k, 33) REP(l, 33) dp[i][j][k][l] = {INF, INF};

        int h, w, s;
        cin >> h >> w >> s;
        if (h == 0 && w == 0 && s == 0) break;
        vector<vector<int>> u(h, vector<int>(w));
        cin >> u;

        int S = 0;
        FORE(r, u) FORE(c, r) S += c;
        int mn = S - s;

        REP(i, h) REP(j, w - 1) u[i][j + 1] += u[i][j];
        REP(i, w) REP(j, h - 1) u[j + 1][i] += u[j][i];

        auto rec = [&](auto f, int y1, int x1, int y2, int x2) -> pii {
            auto &MEMO = dp[y1][x1][y2][x2];
            if (MEMO.first != INF) return MEMO;

            int ps = u[y2 - 1][x2 - 1]
                        - (x1 > 0 ? u[y2 - 1][x1 - 1] : 0)
                        - (y1 > 0 ? u[y1 - 1][x2 - 1] : 0)
                        + (x1 > 0 && y1 > 0 ? u[y1 - 1][x1 - 1] : 0);

            pii ret = {1, ps};
            REPF(x, x1 + 1, x2) {
                pii a = f(f, y1, x1, y2, x);
                pii b = f(f, y1, x, y2, x2);
                if (a.second < mn || b.second < mn) continue;
                chmax(ret, pii{a.first + b.first, min(a.second, b.second)});
            }
            REPF(y, y1 + 1, y2) {
                pii a = f(f, y1, x1, y, x2);
                pii b = f(f, y, x1, y2, x2);
                if (a.second < mn || b.second < mn) continue;
                chmax(ret, pii{a.first + b.first, min(a.second, b.second)});
            }
            return MEMO = ret;
        };

        auto ans = rec(rec, 0, 0, h, w);
        cout << ans.first << " " << s - (S - ans.second) << endl;
    }
    return (0^_^0);
}




Measured memory_bytes: 21684