2235

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

struct Node
{
 int x,y;
 int peanuts;
};

int compare(const void* a,const void* b)
{
 Node* m = (Node*) a;
 Node* n = (Node*) b;
 return n->peanuts-m->peanuts;
}
int main()
{
 const int XX = 2501;
 int t;
 scanf("%d",&t);
 while(t--)
 {
 int m,n,k,num=0,sum=0,time=0;
 Node nuts[XX]={0};
 scanf("%d%d%d",&m,&n,&k);
 int x;
 for(int i=1;i<=m;i++)
  for(int j=1;j<=n;j++)
  {
   scanf("%d",&x);
   if (x)
   {
    nuts[num].x=i;
    nuts[num].y=j;
    nuts[num].peanuts=x;
    num++;
   }
  }
 qsort(nuts,num,sizeof(Node),compare);
 int curindex=0;
 time = nuts[curindex].x+1;
 if (time+nuts[curindex].x <= k)
  sum+= nuts[curindex].peanuts;
 do
 {
 curindex++;
 time+= abs(nuts[curindex].x-nuts[curindex-1].x)+abs(nuts[curindex].y-nuts[curindex-1].y)+1;
 sum+= nuts[curindex].peanuts;
 }
 while(time+nuts[curindex].x<=k);
 if (time+nuts[curindex].x>k)
  sum-= nuts[curindex].peanuts;
 printf("%d/n",sum);
 
 }

// for(i=0;i<num;i++)
//  printf("%d %d %d/n",nuts[i].x,nuts[i].y,nuts[i].peanuts);
 return 0;
}