#include <bits/stdc++.h>
using namespace std;

int t,n,m,dir[][2] = {{1,0},{-1,0},{0,1},{0,-1}};
vector<vector<int> >a;
vector<int>tmp,ans;

void dfs(int x,int y)
{
	tmp.push_back(a[x][y]);
	int cnt = 0;
	for(int i = 0;i < 4;i++)
	{
		int tx = x + dir[i][0],ty = y + dir[i][1];
		if(tx >= 1 && tx <= n && ty >= 1 && ty <= m && a[tx][ty] > a[x][y])
		{
			cnt++;
			dfs(tx,ty);
		}
	}
	if(!cnt)
	{
		if(tmp.size() > ans.size())
			ans = tmp;
		else if(tmp.size() == ans.size())
		{
			int l = tmp.size(),isok = 0;
			for(int i = 0;i < l;i++)
			{
				if(tmp[i] < ans[i])
				{
					isok = 1;
					break;
				}
				if(tmp[i] > ans[i])
					break;
			}
			if(isok)
				ans = tmp;
		}
	}
	tmp.pop_back();
}

int main()
{
	cin >> t;
	while(t--)
	{
		tmp.clear(),ans.clear(),a.clear();
		cin >> n >> m;
		int x1,y1;
		a.push_back({0});
		for(int i = 1;i <= n;i++)
		{
			a.push_back({0});
			for(int j = 1;j <= m;j++)
			{
				int q;
				cin >> q;
				if(!q)
					x1 = i,y1 = j;
				a[i].push_back(q);
			}
		}
		dfs(x1,y1);
		cout << ans.size() << endl;
		for(auto i : ans)
			cout << i << ' ';
		cout << endl;
	}
	return 0;
}