Area

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (100)
int N,M,K,g[MX][MX];
ll S[MX][MX],A,P;
void sum(ll N,ll M){
    static ll H[MX][MX];
    F(N)FF(M)H[i][j]=(i?H[i-1][j]:0)+g[i][j];
    F(N)FF(M)S[i][j]=H[i][j]+(j?S[i][j-1]:0);
}
ll sq(int ax,int ay,int bx,int by){
    ll W(S[bx][by]);
    if(ax)W-=S[ax-1][by];
    if(ay)W-=S[bx][ay-1];
    if(ax&&ay)W+=S[ax-1][ay-1];
    return W;
}
int main(void){
    IN(tt)F(tt){
        A=P=0;
        scanf("%d%d%d",&N,&M,&K);
        F(N)ga(M,g[i]);
        sum(N,M);
        F(N)FF(M)FT(i,N)FOR(l,j,M){
            ll a((k-i+1)*(l-j+1)),p(sq(i,j,k,l));
            if(p<=K&&(a>A||(a==A&&p<P)))P=p,A=a;
        }
        printf("Case #%d: %lld %lld\n",i+1,A,P);
    }
    return 0;
}