#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using i64 = long long;
const int inf = 1e9;
const int mod = 998244353;
struct DSU
{
    vector<int> fa;
    DSU(int n)
    {
        fa.resize(n + 1);
        iota(fa.begin(), fa.end(), 0);
    }
    int find(int u)
    {
        // cout << u << endl;
        if (u == fa[u])
            return u;
        return fa[u] = find(fa[u]);
    }
    bool issame(int u, int v)
    {
        return find(u) == find(v);
    }
    bool merge(int u, int v)
    {
        int fu = find(fa[u]), fv = find(fa[v]);
        if (fu == fv)
            return false;
        fa[fv] = u;
        return true;
    }
};

inline i64 qpow(i64 a, int b)
{
    i64 ans = 1;
    while (b)
    {
        if (b & 1)
            ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<vector<char>> grid(n + 1, vector<char>(m + 1));
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
            cin >> grid[i][j];
    }
    DSU ds(2 * n + 1);
    for (int L = 1, R = m; L <= R; L++, R--)
    {
        int cnt1 = 0;
        vector<pair<int, int>> v;
        for (int i = 1; i <= n; i++)
        {
            if (grid[i][L] == '1')
                cnt1++, v.emplace_back(i, L);
            if (grid[i][R] == '1')
                cnt1++, v.emplace_back(i, R);
        }
        if (L == R)
        {
            if (cnt1 >= 4)
            {
                // cout << "here1";
                cout << 0 << endl;
                return;
            }
            continue;
        }
        if (cnt1 >= 3)
        {
            // cout << "here2";
            cout << "0" << endl;
            return;
        }
        else if (cnt1 < 2)
        {
        }
        else
        {
            if (v[0].first != v[1].first && v[0].second == v[1].second)
            {
                ds.merge(v[0].first, v[1].first + n);
                ds.merge(v[0].first + n, v[1].first);
            }
            else if (v[0].first != v[1].first && v[0].second != v[1].second)
            {
                ds.merge(v[0].first + n, v[1].first + n);
                ds.merge(v[0].first, v[1].first);
            }
        }
    }

    int sum = 0;
    for (int i = 1; i <= n; i++)
    {
        if (ds.issame(i, i + n))
        {
            // cout << "here3";
            cout << 0 << endl;
            return;
        }
        else if (ds.find(i) == i)
        {
            sum++;
        }
    }
    cout << qpow(2, sum) << endl;
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    // system("pause");
    return 0;
}