#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> v;
vector<int> tmp;
string ans = "";
int mx = 0, dir[][2] = {0, 1, 0, -1, 1, 0, -1, 0}, n, m;
void DFS (int r, int c, string a) {
	if (a.size() > mx || a.size() == mx && a < ans) {
		ans = a;
		mx = ans.size();
	}
	int u = int(a.back() - '0');
	for (int i = 0; i < 4; i++) {
		int dr = r + dir[i][0], dc = c + dir[i][1];
		if (1 <= dr && dr <= n && 1 <= dc && dc <= m && v[dr][dc] > u) {
			a.push_back(v[dr][dc] + '0');
			DFS(dr, dc, a);
			a.pop_back();
		}
	}
}
int main() {
	int t;
	cin >> t;
	while (t--) {
		cin >> n >> m;
		tmp.push_back(0);
		v.push_back(tmp);
		tmp.clear();
		for (int i = 1; i <= n; i++) {
			tmp.push_back(0);
			for (int j = 1; j <= m; j++) {
				int num;
				cin >> num;
				tmp.push_back(num);
			}
			v.push_back(tmp);
			tmp.clear();
		}
		string a;
		a.push_back(v[1][1] + '0');
		DFS(1, 1, a);
		cout << mx << endl;
		for(int i = 0; i < ans.size(); i++){
			cout << ans[i] - '0' << " ";
		}
		cout << endl;
		v.clear();
		ans = "", mx = 0;
	}
	return 0;
}