#include<stdio.h>
#define max 51
int map[max][max][max],a,b,c,t;
int next[6][3]={{0,0,1},{0,1,0},{1,0,0},{-1,0,0},{0,-1,0},{0,0,-1}};
struct point
{
int x,y,z;
int time;
}queue[max*max*max];
int bfs()
{
int head=0,tail=1,xi,yi,zi,j;
queue[head].x=0;
queue[head].y=0;
queue[head].z=0;
queue[head].time=0;
map[0][0][0]=1;
while(head<tail)
{
for(j=0;j<6;j++)
{
xi=queue[head].x+next[j][0];
yi=queue[head].y+next[j][1];
zi=queue[head].z+next[j][2];
if(xi<a && yi<b && zi<c && map[xi][yi][zi]==0 && xi>=0 && yi>=0 && zi>=0 )
{
if(xi==a-1 && yi==b-1 && zi==c-1)
return queue[head].time+1;
else if(queue[head].time<t-1)
{
map[xi][yi][zi]=1;
queue[tail].x=xi;
queue[tail].y=yi;
queue[tail].z=zi;
queue[tail++].time=queue[head].time+1;
}
}
}
head++;
}
return -1;
}
int main()
{
int i,j,k,n;
scanf("%d",&n);
while(n--)
{
scanf("%d%d%d%d",&a,&b,&c,&t);
for(i=0;i<a;i++)
for(j=0;j<b;j++)
for(k=0;k<c;k++)
scanf("%d",&map[i][j][k]);
printf("%d\n",bfs());
}
return 0;
}