#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 mod = 1e9 + 7;

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<vector<int>> w(m + 1);
        int sum = 0;
        for(int i = 1;i <= n;i ++)
        {
            for(int j = 1;j <= m;j ++)
            {
                if(g[i][j] == '1')
                {
                    w[j].push_back(i);
                    sum ++;
                }
            }
        }
        vector<vector<int>> e(n + 1);

        bool ok = 1;
        for(int i = 1;i <= m;i ++)
        {
            if(w[i].size() >= 3) ok = 0;
            for(int j = 1;j < w[i].size();j ++)
            {
                if(w[i][j-1] == w[i][j]) continue;
                e[w[i][j-1]].push_back(w[i][j]);
                e[w[i][j]].push_back(w[i][j-1]);
            }

            if(i <= m / 2)
            for(auto j : w[i])
            {
                for(auto k : w[m - i + 1])
                {
                    if(j == k) continue;
                    e[j].push_back(k);
                    e[k].push_back(j);
                }
            }
        }

        int ans = 1;
        vector<int> vis(n + 1);
        auto dfs = [&](auto &&dfs,int u,int fa) -> void
        {
            if(vis[u])
            {
                ok = 0;
                return;
            }
            vis[u] = 1;
            for(auto j : e[u])
            {
                if(j == fa) continue;
                dfs(dfs,j,u);
            }
        };
        for(int i = 1;i <= n;i ++)
        {
            if(!vis[i])
            {
                dfs(dfs,i,0);
                ans = (ans * 2) % mod;
            }
        }

        if(sum > m || !ok) cout << 0 << endl;
        else cout << ans << endl;
    }
}