#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define endl "\n"
const int N = 1e6 + 10;
const ll inf = 1ll << 60, mod = 1e9 + 7;

ll ksm(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}

void solve() {
    int n, m; cin >> n >> m;
    vector<string> a(n + 10);
    int cnt = 0;
    vector<int> b(m + 10);
    vector<int> d(m + 10);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        a[i] = " " + a[i];
        vector<int> res(m + 10);
        for (int j = 1; j <= m; ++j) {
            if (a[i][j] == '1'){
                res[j]++;
                res[m - j + 1] ++; 
                cnt++;
                b[j]++;
                b[m - j + 1] ++;
            }
        }
        for(int j = 1; j <= m; j++) {
            if(res[j] >= 1) {
                d[j] ++;
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        vector<int> res(m + 10);
        for (int j = 1; j <= m; ++j) {
            if (a[i][j] == '1'){ 
                res[j] ++;
                res[m - j + 1] ++;
            }
        }
        int flag = 1;
        for(int j = 1; j <= m; j++) {
            if(res[j] > 0 && res[j] != b[j]) {
                flag = 0;
                break;
            }
        }
        ans += flag;
    }
    for(int i = 1; i <= m; i++) {
        if(b[i] >= 3) {
            cout << 0 << endl;
            return;
        }
    }
    if (ans == n) cout << ksm(2, ans) << endl;
    else cout << ksm(2, ans + 1) << endl;

    
}
/*
3
3 5
01100
10001
00010
2 1
1
1
2 3
001
001

1
3 3
100
010
001

1
4 5
01100
00011
10000
00000

1
2 3
010
010

1
3 6
000100
100010
000001

1
3 5
01000
11000
11000
*/

signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    cin >> _;
    while(_--) solve();
}