#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define gcd __gcd
using namespace std;
typedef pair<int,int> pii;
const int INF = 9e18;
const int inf = 2e9;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int qmi(int a,int k)
{
    int res = 1;
    while(k)
    {
        if(k & 1) res = res * a % mod;
        k >>= 1;
        a = a * a % mod;
    }
    return res;
}
int inv(int x)
{
    return qmi(x,mod-2);
}
int MOD(int x)
{
    return (x % mod + mod) % mod;
}
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t --)
    {
        int n,m;
        cin >> n >> m ;
        vector<string> g(n + 1);
        for(int i = 1;i <= n;i ++) cin >> g[i];
        for(int i = 1;i <= n;i ++) g[i] = " " + g[i];
        vector<int> p(2 * n + 1);
        for(int i = 1;i <= 2 * n;i ++) p[i] = i;
        auto find = [&](auto &&find,int x) -> int
        {
            if(p[x] != x) p[x] = find(find,p[x]);
            return p[x];
        };

        vector<vector<int>> w(m + 1);
        for(int i = 1;i <= n;i ++)
        {
            for(int j = 1;j <= m;j ++)
            {
                if(g[i][j] == '1')
                {
                    w[j].push_back(i);
                }
            }
        }
        auto add = [&](int a,int b) -> int
        {
            int fa= find(find,a),fb = find(find,b);
            if(fa != fb) p[fa] = fb;
            else return 1;
            return 0;
        };
        auto same = [&](int a,int b) -> void
        {
            add(a,b);
            add(a + n,b + b);
        };
        auto rev = [&](int a,int b) -> void
        {
            add(a,b + n);
            add(a + n,b);
        };
        bool ok = 1;
        for(int i = 1;i <= m / 2;i ++)
        {
            if(w[i].size() + w[m - i + 1].size() > 2) ok = 0;
            if(w[i].size() == 1 && w[m -i+1].size() == 1)
            {
                same(w[i][0],w[m-i+1][0]);
            }
            else if(w[i].size() == 2)
            {
                rev(w[i][0],w[i][1]);
            }
            else if(w[m-i+1].size() == 2)
            {
                rev(w[m-i+1][0],w[m-i+1][1]);
            }
        }
        if(m & 1)
        {
            if(w[m / 2 + 1].size() >= 2) ok = 0;
            // if(w[m/2+1].size() == 2)
            // {
            // rev(w[m/2+1][0],w[m/2+1][1]);
            // }
        }
        // cout << "OK" << ok << endl;
        for(int i = 1;i <= n;i ++)
        {
            if(find(find,i) == find(find,i + n)) ok = 0;
        }
        // cout << "OK" << ok << endl;
        int cnt = 0;
        for(int i = 1;i <= n;i ++)
        {
            if(p[i] == i) cnt ++;
        }
        // cout << cnt << endl;
        vector<int> f(n + 1);
        f[0] = 1;
        for(int i = 1;i <= n;i ++) f[i] = f[i-1] * 2 % mod;
        if(ok) cout << f[cnt] << endl;
        else cout << 0 << endl;
    }
}