#include<bits/stdc++.h>

using namespace std;
#define int long long
#define ll long long
const int N = 2e5 + 10;
const int mod = 998244353;

vector<int> fa;

int find(int k){
    if(k == fa[k]) return k;
    return fa[k] = find(fa[k]);
}
void abt(){
    int n, len;
    cin >> n >> len;
    vector<string> s(n + 1);
    vector<vector<int>> cnt(len + 1);
    fa = vector<int>(2 * n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> s[i];
        s[i] = ' ' + s[i];
        for(int j = 1; j <= len; j++) {
            if(s[i][j] == '1') {
                cnt[j].push_back(i);
            }
        }
    }
    int jud = 0;
    for(int i = 1; i <= len / 2; i++) {
        int tmp = cnt[i].size() + cnt[len - i + 1].size();
        if(tmp > 2) {
            jud = 1;
            break;
        }
    }
    if(len % 2 == 1) {
        if(cnt[len / 2 + 1].size() >= 2) jud = 1;
    }
    if(jud) {
        cout << 0 << '\n';
        return;
    }
    for(int i = 1; i <= 2 * n; i++) {
        fa[i] = i;
    }
    for(int i = 1; i <= len / 2; i++) {
        int tmp = cnt[i].size() + cnt[len - i + 1].size();
        if(tmp == 2) {
            if(cnt[i].size() == 2) {
                fa[find(cnt[i][0])] = find(cnt[i][1] + n);
                fa[find(cnt[i][0] + n)] = find(cnt[i][1]);
            } else if(cnt[len - i + 1].size() == 2) {
                fa[find(cnt[len - i + 1][0])] = find(cnt[len - i + 1][1] + n);
                fa[find(cnt[len - i + 1][0] + n)] = find(cnt[len - i + 1][1]);
            } else {
                fa[find(cnt[i][0])] = find(cnt[len - i + 1][0]);
                fa[find(cnt[i][0] + n)] = find(cnt[len - i + 1][0] + n);
            }
        }
    }
    jud=0;
    for(int i=1;i<=n;i++) {
        if(find(i)==find(i+n)) {
            jud=1;
            break;
        }
    }
    if(jud) {
        cout << 0 << '\n';
        return;
    }
    int ans = 0;
    vector<int> idx(2 * n + 1);
    for(int i = 1; i <= 2 * n; i++) {
        if(idx[find(i)] == 0) {
            ans++;
        }
        idx[find(i)]++;
    }

    ans /= 2;
    int r=1,base=2;
    while(ans>0) {
        if(ans%2==1) r=base*r%mod;
        base=base*base%mod;
        ans>>=1;
    }
    cout << r << '\n';
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while(T--) abt();
    return 0;
}