// Problem: G. Gifts from Knowledge
// Contest: Codeforces - The 2023 ICPC Asia Jinan Regional Contest (The 2nd Universal Cup. Stage 17: Jinan)
// URL: https://codeforces.com/gym/104901/problem/G
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;

typedef long long i64;
typedef array<int, 3> arr;
typedef pair<int, int> PII;

const int mod = 1E9 + 7;

struct DSU {
    std::vector<int> f, siz;
    
    DSU() {}
    DSU(int n) {
        init(n);
    }
    
    void init(int n) {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }
    
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    
    int size(int x) {
        return siz[find(x)];
    }
};

int power(int a, i64 b, int p) {
    int res = 1;
    for (; b; b /= 2, a = 1LL * a * a % p) {
        if (b % 2) {
            res = 1LL * res * a % p;
        }
    }
    return res;
}

void solve() {
	int r, c;
	cin >> r >> c;	
	
	vector<string> s(r + 1);
	for (int i = 1; i <= r; i++) {
		cin >> s[i];
		s[i] = " " + s[i];
	}
	
	for (int j = 1; j <= (c + 1) / 2; j++) {
		int cnt = 0;
		for (int i = 1; i <= r; i++) {
			cnt += s[i][j] == '1';
			if (c & 1 && j != (c + 1) / 2) {
				cnt += s[i][c - j + 1] == '1';
			}
		}
		if (cnt > 2 || (c & 1 && j == (c + 1) / 2 && cnt >= 2)) {
			cout << 0 << "\n";
			return;
		}
	}

	DSU dsu(2 * r + 2);
	for (int j = 1; j <= c / 2; j++) {
		vector<int> v1, v2;
		for (int i = 1; i <= r; i++) {
			if (s[i][j] == '1') v1.push_back(i);
			if (s[i][c - j + 1] == '1') v2.push_back(i);
		}
		if (v1.size() == 1 && v2.size() == 1) {
			dsu.merge(v1.back(), v2.back());
			dsu.merge(v1.back() + r, v2.back() + r);	
		} else if (v1.empty() && v2.size() == 2) {
			dsu.merge(v2[0], v2[1] + r);
			dsu.merge(v2[0] + r, v2[1]);			
		} else if (v1.size() == 2 && v2.empty()) {
			dsu.merge(v1[0], v1[1] + r);
			dsu.merge(v1[0] + r, v1[1]);	
		}
	}
	
	for (int i = 1; i <= r; i++) {
		if (dsu.same(i, i + r)) {
			cout << 0 << "\n";
			return;
		}
	}
	
	int cnt = 0;
	for (int i = 1; i <= r; i++) {
		cnt += dsu.find(i) == i;
	}
	
	cout << power(2, cnt, mod) << "\n";
}

signed main() {
	cin.tie(nullptr)->ios::sync_with_stdio(false);
	
	int T;
	cin >> T;
	
	while (T--) {
		solve();
	}

	return 0;	
}