#include <stdio.h>

const int MAX_SIZE = 8;

int N , M;
int dir[4][2] = {-1 , 0 , 0 , 1 , 1 , 0 , 0 , -1};
int iTime[MAX_SIZE * MAX_SIZE][2];
int pos[MAX_SIZE][MAX_SIZE];

int endTime;
int solve(int y , int x , int t)
{
    if(y == N && x == M)
        return t == endTime;

    int ret = 0;
    if(pos[y][x] == -1 ||  pos[y][x] == t)
    {
        int prev = pos[y][x];
        pos[y][x] = -2;
        if(!iTime[t][0] || (iTime[t][0] == y && iTime[t][1] == x))
        {
            for(int i = 0;i < 4;i++)
            {
                int ny = y + dir[i][0];
                int nx = x + dir[i][1];

                if(pos[ny][nx] != -2)
                    ret += solve(ny , nx , t + 1);
            }
        }
        pos[y][x] = prev;
    }

    return ret;
}

int main(void)
{
    int T;
    for(scanf("%d" , &T);T--;)
    {
        scanf("%d %d" , &N , &M);

        endTime = N * M - 1;
        for(int i = 0;i <= endTime;i++)
            iTime[i][0] = iTime[i][1] = 0;

        for(int i = 1;i <= N;i++)
        {
            pos[i][0] = pos[i][M + 1] = -2;
            for(int j = 1;j <= M;j++)
            {
                scanf("%d" , &pos[i][j]);
                int t = pos[i][j];
                if(t != -1)
                    iTime[t][0] = i , iTime[t][1] = j;
            }
        }

        for(int i = 1;i <= M;i++)
            pos[0][i] = pos[N + 1][i] = -2;

        printf("%d\n" , !(N & 1) && !(M & 1) ? 0 : solve(1 , 1 , 0));
    }
    return 0;
}