#include <iostream>

const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

// 深度优先搜索函数
void dfs(int x, int y, int* path, int& pathLen, int** matrix, int n, int m, int* longestPath, int& longestPathLen) {
    int curVal = matrix[x][y];
    path[pathLen++] = curVal;

    if (pathLen > longestPathLen) {
        longestPathLen = pathLen;
        for (int i = 0; i < pathLen; ++i) {
            longestPath[i] = path[i];
        }
    } else if (pathLen == longestPathLen && std::lexicographical_compare(path, path + pathLen, longestPath, longestPath + longestPathLen)) {
        longestPathLen = pathLen;
        for (int i = 0; i < pathLen; ++i) {
            longestPath[i] = path[i];
        }
    }

    for (int i = 0; i < 4; ++i) {
        int newX = x + dx[i];
        int newY = y + dy[i];
        if (newX >= 0 && newX < n && newY >= 0 && newY < m && matrix[newX][newY] > curVal) {
            dfs(newX, newY, path, pathLen, matrix, n, m, longestPath, longestPathLen);
        }
    }

    pathLen--;
}

int main() {
    int T;
    std::cin >> T;
    while (T--) {
        int n, m;
        std::cin >> n >> m;
        int** matrix = new int*[n];
        for (int i = 0; i < n; ++i) {
            matrix[i] = new int[m];
            for (int j = 0; j < m; ++j) {
                std::cin >> matrix[i][j];
            }
        }
        int* longestPath = new int[n * m];
        int longestPathLen = 0;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                int* path = new int[n * m];
                int pathLen = 0;
                dfs(i, j, path, pathLen, matrix, n, m, longestPath, longestPathLen);
                delete[] path;
            }
        }
        std::cout << longestPathLen << std::endl;
        for (int i = 0; i < longestPathLen; ++i) {
            std::cout << longestPath[i] << " ";
        }
        std::cout << std::endl;
        for (int i = 0; i < n; ++i) {
            delete[] matrix[i];
        }
        delete[] matrix;
        delete[] longestPath;
    }
    return 0;
}