#if __has_include("../library/Basic/Debug.hpp")

#include "../library/Basic/Debug.hpp"

#else

/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>
#include <cstdint>


/* ----- Type Alias ----- */
using Bool = bool;
using Int = long long int;
using Real = long double;
using Char = char;
using String = std::string;
template <class T, class U>
using Pair = std::pair<T, U>;
template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T>
using Vector = std::vector<T>;
template <size_t N>
using Bits = std::bitset<N>;
template <class T>
using Queue = std::queue<T>;
template <class T>
using Stack = std::stack<T>;
template <class T>
using Deque = std::deque<T>;

template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using Set = std::set<T>;
template <class T, class U>
using Map = std::map<T, U>;

template <class T, class... Us>
using Func = std::function<T(Us...)>;

template <class T>
T genv(T v) { return v; }

template <class T, class... Ts>
auto genv(size_t l, Ts... ts) {
    return Vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}

template <class Cost = Int>
struct Edge {
    Int src, dst;
    Cost cost;
    Edge(Int src = -1, Int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = Int>
using Edges = Vector<Edge<Cost>>;
template <class Cost = Int>
using Graph = Vector<Vector<Edge<Cost>>>;

#endif

/* ----- Misc ----- */
void fastio() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

struct Fout {
    Int precision;
    Fout(Int precision) : precision(precision) {}
};
std::ostream& operator<<(std::ostream& os, const Fout& fio) {
    os << std::fixed << std::setprecision(fio.precision);
    return os;
}


/* ----- Constants ----- */
constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
// constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));

Bool solve() {
    Int h, w, s;
    std::cin >> h >> w >> s;
    if (h == 0) return false;

    Vector<Vector<Int>> usum(h + 1, Vector<Int>(w + 1, 0));
    for (Int x = 1; x <= h; ++x) {
        for (Int y = 1; y <= w; ++y) {
            std::cin >> usum[x][y];
            usum[x][y] += usum[x][y - 1] + usum[x - 1][y] - usum[x - 1][y - 1];
        }
    }
    s = usum[h][w] - s;
    // 各区画はsを下回ってはならない

    // 1-indexed、閉区間
    auto sum = [&](Int lx, Int ly, Int rx, Int ry) {
        return usum[rx][ry] - usum[rx][ly - 1] -
               usum[lx - 1][ry] + usum[lx - 1][ly - 1];
    };

    auto dp = genv<Pair<Int, Int>>(h, w, h, w, std::make_pair(INF, INF));

    // 区画数、予備力
    std::function<Pair<Int, Int>(Int, Int, Int, Int)> dfs =
        [&](Int lx, Int ly, Int rx, Int ry) {
            auto& ret = dp[lx - 1][ly - 1][rx - 1][ry - 1];
            if (ret.first != INF) return ret;

            Int p = sum(lx, ly, rx, ry);
            if (p < s) {
                return ret = std::make_pair(-INF, INF);
            } else {
                ret = std::make_pair(1, p - s);
            }

            for (Int x = lx; x < rx; ++x) {
                auto l = dfs(lx, ly, x, ry);
                auto r = dfs(x + 1, ly, rx, ry);
                auto res = std::make_pair(
                    l.first + r.first,
                    std::min(l.second, r.second));
                if (ret.first < res.first ||
                    (ret.first == res.first && ret.second < res.second)) {
                    ret = res;
                }
            }

            for (Int y = ly; y < ry; ++y) {
                auto l = dfs(lx, ly, rx, y);
                auto r = dfs(lx, y + 1, rx, ry);
                auto res = std::make_pair(
                    l.first + r.first,
                    std::min(l.second, r.second));
                if (ret.first < res.first ||
                    (ret.first == res.first && ret.second < res.second)) {
                    ret = res;
                }
            }
            return ret;
        };

    auto ans = dfs(1, 1, h, w);
    std::cout << ans.first << ' ' << ans.second << std::endl;
    return true;
}

int main() {
    while (solve()) {}
    return 0;
}



Measured memory_bytes: 21052