#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
    int n, m;
    cin >> n >> m;
    vector < string > a(n);
    for(int i = 0; i < n; i ++) cin >> a[i];
    vector < int > cnt(m, 0), ncnt(m, 0);
    int res = 1;
    for(int i = 0; i < n; i ++) {
        int cur = 2;
        bool tag = 1;
        for(int j = 0; j < m; j ++) ncnt[j] = cnt[j] + (a[i][j] == '1');
        for(int j = 0; j < m; j ++) if(ncnt[j] > 1) {
            cur --;
            tag = 0;
            break;
        }
        reverse(a[i].begin(), a[i].end());
        for(int j = 0; j < m; j ++) ncnt[j] = cnt[j] + (a[i][j] == '1');
        for(int j = 0; j < m; j ++) if(ncnt[j] > 1) {
            cur --;
            break;
        }
        res = 1ll * res * cur % mod;
        if(tag) {
            reverse(a[i].begin(), a[i].end());
            for(int j = 0; j < m; j ++)
                cnt[j] += (a[i][j] == '1');
        } else cnt = ncnt;
    }
    cout << res << '\n';
}
int main() {
    ios :: sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while(T --) solve();
    return 0;
}