#include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <queue>

 using namespace std;

 #define MAXNUM 50

 #define SETPOS(pos,xx,yy,zz,tt) pos.x=xx;pos.y=yy;pos.z=zz;pos.t=tt;

 typedef struct {

     int x, y, z;

     int t;

 } pos_st;

 int map[MAXNUM][MAXNUM][MAXNUM];

 int visit[MAXNUM][MAXNUM][MAXNUM];

 int direct[][] = {{,,},{-,,},{,,},{,-,},{,,},{,,-}};

 int a, b, c, mintime;

 queue<pos_st> poss;

 void bfs(int x, int y, int z, int t) {

     pos_st pos, tmp;

     SETPOS(pos,x,y,z,t);

     poss.push(pos);

     visit[x][y][z] = ;

     while (!poss.empty()) {

         pos = poss.front();

         poss.pop();

         if (pos.t > mintime) {

             printf("-1\n");

             return;

         }

         if (pos.x==a- && pos.y==b- && pos.z==c-) {

             printf("%d\n", pos.t);

             return;

         }

         for (int i=; i<; ++i) {

             SETPOS(tmp, pos.x+direct[i][], pos.y+direct[i][], pos.z+direct[i][], pos.t+);

             if (tmp.x< || tmp.x>=a || tmp.y< || tmp.y>=b || tmp.z< || tmp.z>=c)

                 continue;

             if (visit[tmp.x][tmp.y][tmp.z] || map[tmp.x][tmp.y][tmp.z]==)

                 continue;

             visit[tmp.x][tmp.y][tmp.z] = ;

             poss.push(tmp);

         }

     }

     printf("-1\n");

 }

 int main() {

     int case_n;

     int i, j, k;

     scanf("%d", &case_n);

     while (case_n--) {

         scanf("%d%d%d%d", &a,&b,&c,&mintime);

         for (i=; i<a; ++i)

             for (j=; j<b; ++j)

                 for (k=; k<c; ++k)

                     scanf("%d", &map[i][j][k]);

         memset(visit, , sizeof(visit));

         while (!poss.empty())

             poss.pop();

         bfs(,,,);

     }

     return ;

 }