#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;
const double EPS = 1e-10;

template<class T>bool chmax(T &a, const T &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>bool chmin(T &a, const T &b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) {
        is >> e;
    }
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using MatrixGraph = vector<vector<T>>;

int main()
{
    while (true) {
        int h, w, s; cin >> h >> w >> s;
        if (h == 0 && w == 0 && s == 0) {
            break;
        }
        auto u = make_v<int>(h, w);
        int u_sum = 0;
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < w; ++j) {
                cin >> u[i][j];
                u_sum += u[i][j];
            }
        }

        auto us = make_v<int>(h+1, w+1);
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < w; ++j) {
                us[i+1][j+1] = us[i+1][j] + us[i][j+1] - us[i][j] + u[i][j];
            }
        }

        auto dp = make_vector<int>(h+1, h+1, w+1, w+1, -1);
        auto res = make_vector<int>(h+1, h+1, w+1, w+1, -1);
        for (int a = 0; a <= h; ++a) {
            for (int b = 0; b <= w; ++b) {
                for (int i = 0; i+a <= h; ++i) {
                    for (int j = 0; j+b <= w; ++j) {

                        int ts = us[i+a][j+b] - us[i+a][j] - us[i][j+b] + us[i][j];
                        if (ts >= u_sum - s) {
                            if (dp[i][i+a][j][j+b] == 1) {
                                chmax(res[i][i+a][j][j+b], ts - (u_sum - s));
                            } else if (dp[i][i+a][j][j+b] < 1) {
                                dp[i][i+a][j][j+b] = 1;
                                res[i][i+a][j][j+b] = ts - (u_sum - s);
                            }
                        }

                        for (int r = i+1; r < i+a; ++r) {
                            if (dp[i][r][j][j+b] == -1 ||
                                dp[r][i+a][j][j+b] == -1) {
                                continue;
                            }
                            if (dp[i][i+a][j][j+b] ==
                                    dp[i][r][j][j+b] + dp[r][i+a][j][j+b]) {
                                chmax(res[i][i+a][j][j+b],
                                    min(res[i][r][j][j+b], res[r][i+a][j][j+b]));
                            } else if (dp[i][i+a][j][j+b] <
                                    dp[i][r][j][j+b] + dp[r][i+a][j][j+b]) {
                                dp[i][i+a][j][j+b] =
                                    dp[i][r][j][j+b] + dp[r][i+a][j][j+b];
                                res[i][i+a][j][j+b] =
                                    min(res[i][r][j][j+b], res[r][i+a][j][j+b]);
                            }
                        }

                        for (int c = j+1; c < j+b; ++c) {
                            if (dp[i][i+a][j][c] == -1 ||
                                dp[i][i+a][c][j+b] == -1) {
                                continue;
                            }
                            if (dp[i][i+a][j][j+b] ==
                                    dp[i][i+a][j][c] + dp[i][i+a][c][j+b]) {
                                chmax(res[i][i+a][j][j+b],
                                    min(res[i][i+a][j][c], res[i][i+a][c][j+b]));
                            } else if (dp[i][i+a][j][j+b] <
                                    dp[i][i+a][j][c] + dp[i][i+a][c][j+b]) {
                                dp[i][i+a][j][j+b] =
                                    dp[i][i+a][j][c] + dp[i][i+a][c][j+b];
                                res[i][i+a][j][j+b] =
                                    min(res[i][i+a][j][c], res[i][i+a][c][j+b]);
                            }
                        }

                    }
                }
            }
        }

        printf("%d %d\n", dp[0][h][0][w], res[0][h][0][w]);
    }

    return 0;
}



Measured memory_bytes: 15180