#include <bits/stdc++.h>

using namespace std;

const long long mod = 998244353;
const int MaxN = 2e5 + 5;

int n, m;
vector<vector<int>> arr;
vector<vector<bool>> mark;

void Inp()
{
    cin >> n >> m;
    mark.clear();
    arr.clear();
    arr.resize(n + 1);
    mark.resize(n + 1);
    arr[0].resize(m + 1);
    mark[0].resize(m + 1);
    for (int x = 1; x <= n; x++)
    {
        arr[x].resize(m + 1);
        mark[x].resize(m + 1);
        for (int y = 1; y <= m; y++)
        {
            cin >> arr[x][y];
            if (arr[x][y] > 0)
            {
                arr[x][y] -= x + y - 1;
            }
            else
            {
                mark[x][y] = true;
            }
        }
    }
}

vector<vector<long long>> F;
long long sum[MaxN];

void Exc()
{
    F.clear();
    F.resize(n + 1);
    for (int x = 0; x <= n; x++)
    {
        F[x].resize(m + 1);
    }
    for (int x = 1; x <= n; x++)
    {
        for (int y = 1; y <= m; y++)
        {
            if (!mark[x][y] && arr[x][y] != 0 && arr[x][y] != 1)
            {
                cout << 0 << "\n";
                return;
            }
        }
    }
    F[0][0] = 1;
    for (int x = 1; x <= n; x++)
    {
        sum[0] = F[x - 1][0];
        F[x][0] = 0;
        for (int y = 1; y <= m; y++)
        {
            sum[y] = (sum[y - 1] + F[x - 1][y]) % mod;
            F[x][y] = 0;
        }
        int mi = m + 1, mx = 0;
        for (int y = 1; y <= m; y++)
        {
            if (arr[x][y] == 0)
            {
                mx = max(mx, y);
            }
            if (arr[x][y] == 1)
            {
                mi = min(mi, y);
            }
        }
        for (int y = m - mi + 1; y <= m - mx; y++)
        {
            F[x][y] = sum[y];
        }
    }
    long long res = 0;
    for (int x = 0; x <= m; x++)
    {
        res = (res + F[n][x]) % mod;
    }
    cout << res << "\n";
}

int main()
{
    //freopen("C.INP", "r", stdin);
    //freopen("C.OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
    cin >> test;
    for (int x = 1; x <= test; x++)
    {
        Inp();
        Exc();
    }
    return 0;
}