#include <bits/stdc++.h>

using namespace std;
int t,n,m,a[1005][1005],ans[1005],Mcd=0,lj[1005],fx[]={1,0,-1,0,1};
bool vis[1005][1005];
int read();
void write(int x);
void dfs(int deep,int x,int y);
int main()
{
    t=read();
    for(int i=1;i<=t;i++){
        n=read();
        m=read();
        Mcd=0;

        lj[1]=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                a[i][j]=read();

            }

        }
        dfs(1,1,1);
        write(Mcd);
        putchar('\n');
        for(int i=1;i<=Mcd;i++){
            write(ans[i]);
            putchar(' ');
        }
        putchar('\n');
    }
    return 0;
}

int read(){
    int x,y=1;char c;
    while((c=getchar())>'9'||c<'0') if(c=='-') y=-1;
    x=(c^48);
    while((c=getchar())>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48);
    return x*y;
}

void write(int x){
    if(x<0) x=-x,putchar('-');
    if(x>9) write(x/10);
    putchar(x%10+48);
}

void dfs(int deep,int x,int y){
    bool f=0;
    for(int i=0;i<4;i++){
        int nx=x+fx[i],ny=y+fx[i+1];
        if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&a[nx][ny]>lj[deep]){
            f=1;

            lj[deep+1]=a[nx][ny];

            dfs(deep+1,nx,ny);

        }
    }
    if(f==0){
        if(deep>Mcd){
            Mcd=deep;
            memcpy(ans,lj,sizeof(lj));
        }
        else if(deep==Mcd){
            for(int i=1;i<=deep;i++){
                if(lj[i]<ans[i]){
                    memcpy(ans,lj,sizeof(ans));
                    break;
                }
            }
        }
    }
}