#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <sys/timeb.h>
#include <fstream>
#include <random>
#include <regex>
#include <chrono>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <limits>

using namespace std;

//#define DEBUG_

#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.141592653589793238
#define RMAX 4294967295


#ifdef DEBUG_
#define DEB
#else
#define DEB if(false)
#endif

#ifdef DEBUG_
#define dump(...) DUMPOUT<<"  "; \
dump_func(string(#__VA_ARGS__) + ":", "[" + to_string(__LINE__) + ":" + __FUNCTION__ + "]"); \
DUMPOUT<<"    "; \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

typedef long long ll;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<Pll> vPll;
typedef vector<Pd>vPd;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<double> > vvd;
typedef vector<vector<Pi> > vvPi;
typedef vector<vector<vector<int> > > vvvi;
typedef vector<vector<vector<ll> > > vvvll;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi> > pqlP;
template <class T>
using vec = vector<T>;
template<class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
	return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}

#define DUMPOUT cerr

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

// vector
template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
	for (T& x : vec) is >> x;
	return is;
}
// pair
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << "," << pair_var.second << ")";
	return os;
}
// pair
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << "," << pair_var.second << ")";
	return os;
}
// vector
template<typename T>
ostream& operator << (ostream& os, const vector<T>& vec) {
	os << "{";
	for (int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
	}
	os << "}";
	return os;
}
// map
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	os << "{";
	repi(itr, map_var) {
		os << "(" << itr->first << "," << itr->second << ")";
		itr++;
		if (itr == map_var.end()) os << ", ";
		itr--;
	}
	os << "}";
	return os;
}
// set
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	os << "{";
	repi(itr, set_var) {
		os << "  " << *itr << endl;
		itr++;
		if (itr == set_var.end()) os << ", ";
		itr--;
	}
	os << "}";
	return os;
}
string YN(bool y, int id = 0) { if (id)cout << id; return (y ? "YES" : "NO"); }
string yn(bool y, int id = 0) { if (id)cout << id; return (y ? "Yes" : "No"); }
string ON(bool y, int id = 0) { if (id)cout << id; return (y ? "OK" : "NG"); }

int dir4[4][2] = { { 0,-1 },{ -1,0 },{ 1,0 },{ 0,1 } };
int dir8[8][2] = { { -1,-1 },{ 0,-1 },{ 1,-1 },{ -1,0 },{ 1,0 },{ -1,1 },{ 0,1 },{ 1,1 } };

// [a,b)
int irand(int a, int b) {
	static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
	uniform_int_distribution<int> dist(a, b - 1);
	return dist(Rand);
}

// [a,b)
double drand(int a, int b) {
	static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
	uniform_real_distribution<double> dist(a, b);
	return dist(Rand);
}
struct Edge {
	int from, to, cost;
};
using Graph = vec<vec<Edge>>;

//======================================================

Pi solve(const vvi &ucum, Pi lu, Pi rd, int lack, vec<vec<vvPi>> &memo, int depth = 0) {
	if (memo[lu.first][lu.second][rd.first][rd.second] != mp(-2, -2)) {
		return memo[lu.first][lu.second][rd.first][rd.second];
	}

	int sum = ucum[rd.first + 1][rd.second + 1] - ucum[rd.first + 1][lu.second] - ucum[lu.first][rd.second + 1] + ucum[lu.first][lu.second];

	//cerr << string(depth, ' ') << lu << "," << rd << "," << sum << endl;
	if (sum < lack)return memo[lu.first][lu.second][rd.first][rd.second] = mp(-1, -1);
	if (sum < lack * 2)return memo[lu.first][lu.second][rd.first][rd.second] = mp(1, sum - lack);

	Pi best = mp(1, sum - lack);
	repr(i, lu.first, rd.first) {
		// 横分割
		Pi res1 = solve(ucum, lu, mp(i, rd.second), lack, memo, depth+1);
		Pi res2 = solve(ucum, mp(i + 1, lu.second), rd, lack, memo, depth+1);
		//cerr << string(depth, ' ') << lu << ", " << mp(i, rd.second) << res1 << endl;
		//cerr << string(depth, ' ') << mp(i + 1, lu.second) << ", " << rd << res2 << endl;
		if (res1.first == -1 || res2.first == -1)continue;
		Pi res = mp(res1.first + res2.first, min(res1.second, res2.second));
		if (res.first > best.first) {
			best = res;
		}
		else if (res.first == best.first && res.second > best.second) {
			best = res;
		}
	}
	repr(j, lu.second, rd.second) {
		// 縦分割
		Pi res1 = solve(ucum, lu, mp(rd.first, j), lack, memo, depth+1);
		Pi res2 = solve(ucum, mp(lu.first, j + 1), rd, lack, memo, depth+1);
		//cerr << string(depth, ' ') << lu << ", " << mp(rd.first, j) << res1 << endl;
		//cerr << string(depth, ' ') << mp(lu.first, j + 1) << ", " << rd << res2 << endl;
		if (res1.first == -1 || res2.first == -1)continue;
		Pi res = mp(res1.first + res2.first, min(res1.second, res2.second));
		if (res.first > best.first) {
			best = res;
		}
		else if (res.first == best.first && res.second > best.second) {
			best = res;
		}
	}
	return memo[lu.first][lu.second][rd.first][rd.second] = best;
}

int main() {
	while (true) {
		int h, w, s;
		cin >> h >> w >> s;
		if (h == 0 && w == 0 && s == 0) break;
		vvi ucum(h+1, vi(w+1, 0));
		rep(i, h)rep(j, w) {
			cin >> ucum[i + 1][j + 1];
		}
		repr(i, 1, h + 1)rep(j, w + 1) {
			ucum[i][j] += ucum[i - 1][j];
		}
		repr(j, 1, w + 1)rep(i, h + 1) {
			ucum[i][j] += ucum[i][j - 1];
		}
		int total = ucum[h][w];
		int lack = total - s;

		vec<vec<vvPi>> memo(h, vec<vvPi>(w, vvPi(h, vPi(w, mp(-2, -2)))));

		Pi ans = solve(ucum, mp(0, 0), mp(h - 1, w - 1), lack, memo);
		cout << ans.first << " " << ans.second << endl;
	}

	return 0;
}


Measured memory_bytes: 12624