//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

#include<memory>


using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
//const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false

//debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

pair<int, int> dp[32][32][32][32];
int rsum[33][33];
int psum[33][33][33][33];
vector<vector<int>> g(32, vector<int>(32, 0));

//(x1, y1):左上, (x2, y2):右下
pair<int, int> dfs(int y1, int x1, int y2, int x2, int total, int limit) {
  //cerr << y1 << " " << x1 << " " << y2 << " " << x2 << endl;
  if (dp[y1][x1][y2][x2].second != 0) return dp[y1][x1][y2][x2];
  //何もしない
  if (total - psum[y1+1][x1+1][y2+1][x2+1] <= limit) {
    dp[y1][x1][y2][x2] = {limit - (total - psum[y1+1][x1+1][y2+1][x2+1]), 1};
  }
  else {
    //これ以上はどう頑張っても分割不可
    return dp[y1][x1][y2][x2];
  }
  //水平に切る
  for (int i = y1; i < y2; i++) {
    //上側
    int ny1 = y1;
    int nx1 = x1;
    int ny2 = i;
    int nx2 = x2;
    pair<int, int> up = dfs(ny1, nx1, ny2, nx2, total, limit);
    //下側
    ny1 = i+1;
    nx1 = x1;
    ny2 = y2;
    nx2 = x2;
    pair<int, int> bt = dfs(ny1, nx1, ny2, nx2, total, limit);
    if (up.second == 0 || bt.second == 0) continue; // 分割できなかった
    int cnt = up.second + bt.second;
    if (dp[y1][x1][y2][x2].second < cnt) {
        dp[y1][x1][y2][x2] = {min(up.first, bt.first), cnt};
    }
    else if (dp[y1][x1][y2][x2].second == cnt) {
      if (dp[y1][x1][y2][x2].first < min(up.first, bt.first)) {
        dp[y1][x1][y2][x2] = {min(up.first, bt.first), cnt};
      }
    }
  }
  //垂直に切る
  for (int j = x1; j < x2; j++) {
    //左側
    int ny1 = y1;
    int nx1 = x1;
    int ny2 = y2;
    int nx2 = j;
    pair<int, int> l = dfs(ny1, nx1, ny2, nx2, total, limit);
    //右側
    ny1 = y1;
    nx1 = j+1;
    ny2 = y2;
    nx2 = x2;
    pair<int, int> r = dfs(ny1, nx1, ny2, nx2, total, limit);
    int cnt = l.second + r.second;
    if (l.second == 0 || r.second == 0) continue; // 分割できなかった
    if (dp[y1][x1][y2][x2].second < cnt) {
        dp[y1][x1][y2][x2] = {min(l.first, r.first), cnt};
    }
    else if (dp[y1][x1][y2][x2].second == cnt) {
      if (dp[y1][x1][y2][x2].first < min(l.first, r.first)) {
        dp[y1][x1][y2][x2] = {min(l.first, r.first), cnt};
      }
    }
  }
  return dp[y1][x1][y2][x2];
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  while (true) {
    int h, w, s;
    cin >> h >> w >> s;
    if (h == 0) break;
    int total = 0;
    rep(i, h)rep(j, w) {
      cin >> g[i][j];
      total += g[i][j];
    }
    int limit =   s;
    rep(i, 33)rep(j, 33)rep(k, 33)rep(l, 33) psum[i][j][k][l] = 0;
    rep(i, 33)rep(j, 33) rsum[i][j] = 0;
    rep(i, h)rep(j, w) {
      rsum[i+1][j+1] = rsum[i+1][j] + rsum[i][j+1] - rsum[i][j] + g[i][j];
    }
    rep(i, h)rep(j, w)rep(k, h)rep(l, w) {
      psum[i+1][j+1][k+1][l+1] = rsum[k+1][l+1] - rsum[i][l+1] - rsum[k+1][j] + rsum[i][j];
    }
    rep(i, 32)rep(j, 32)rep(k, 32)rep(l, 32) dp[i][j][k][l] = {INF, 0};
    pair<int, int> ans = dfs(0, 0, h-1, w-1, total, limit);
    cout << ans.second << " " << ans.first << endl;
  }
}



Measured memory_bytes: 28848