#include<bits/stdc++.h>

using namespace std;

int m1[][];int n,m,chance;

bool vis[][][];

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

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

struct  node

{

    int x,y,d,c;

    node(int x=,int y=,int d=,int c=):x(x),y(y),d(d),c(c){}

};

bool inmap(int x,int y)

{

    if(x>=&&x<=n&&y>=&&y<=m)return true;

    return false;

}

void bfs()

{   memset(vis,false,sizeof(vis));

    node u(,,,);

    queue<node>q;

    q.push(u);

    vis[][][]=true;

    while(!q.empty())

    {

       u=q.front();q.pop();

       if(u.x==n&&u.y==m){printf("%d\n",u.d);return;}

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

       {

           node v(u.x+dx[i],u.y+dy[i],u.d+,u.c);

           if(m1[v.x][v.y])

            v.c++;

           else v.c=;

           if(v.c<=chance&&!vis[v.x][v.y][v.c]&&inmap(v.x,v.y))

           {

               vis[v.x][v.y][v.c]=true;

               q.push(v);

           }

       }

    }

    printf("-1\n");

    return ;

}

int main()

{

    int cas;cin>>cas;

    while(cas--)

    {

        scanf("%d %d %d",&n,&m,&chance);

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

            for(int j=;j<=m;j++)

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

         bfs();

    }

}