#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
#define ar array
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
int binpow(int a, int b){
if(b == 0)return 1;
if(b % 2 == 0){
int c = binpow(a,b/2);
return (c*c)%mod;
}
return (binpow(a,b-1)*a)%mod;
}
int divi(int a, int b){
return (a*(binpow(b,mod-2)))%mod;
}
int n,m,k;
vector<int>l(1005), r(1005);
void solve(){
cin >> n >> m >> k;
int arr[n+1][m+1];
for(int i = 0;i<n;i++)
for(int j = 0;j<m;j++)
cin >> arr[i][j];
int area = 0, ans = -1;
int l1 = 1, r1 = 1e9;
while(l1<=r1){
int mid = (l1+r1)/2;
int dp[n+1][m+1]{};
for(int i = n-1;i>=0;i--)
for(int j = 0;j<m;j++){
if(arr[i][j] >= mid)dp[i][j] = dp[i+1][j] + 1;
else dp[i][j] = 0;
}
int mx = -1;
for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
l[j] = j - 1;
while(l[j] >= 0 && dp[i][l[j]] >= dp[i][j])l[j] = l[l[j]];
}
for(int j = m - 1;j>=0;j--){
r[j] = j + 1;
while(r[j] < m && dp[i][r[j]] >= dp[i][j])r[j] = r[r[j]];
umax(mx, (r[j]-l[j]-1)*dp[i][j]);
}
}
if(mx >= k){
l1 = mid + 1;
area = mx;
ans = mid;
}
else{
r1 = mid - 1;
}
}
cout << ans << " " << area << "\n";
}
/*
2
2
2 1
4
2 3 1 4
*/
signed main()
{
// freopen("seq.in", "r", stdin);
// freopen("seq.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int tt=1;//cin>>tt;
while(tt--)solve();
}
