#include <bits/stdc++.h>
#define rep1(i, l, r) for (int i = l; i <= int(r); ++i)
#define rep2(i, l, r) for (int i = l; i >= int(r); --i)
#define rer(i, l, r, a) rep1(i, l, r) read(a[i])
#define ptc putchar
#define il inline
#define eb emplace_back
#define ef emplace_front
#define mp make_pair
#define fst first
#define snd second
#define sqr(x) ((x) * (x))
#define ls(x) x << 1
#define rs(x) x << 1 | 1
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// typedef __int128 bll;
// typedef unsigned __int128 ubll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e6 + 10, LOGN = log2(MAXN) + 1, inf = ~0U >> 2, INF = ~0U >> 1;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
namespace stupid_lrc {
	template <typename T> il bool read(T &x) {
		x = 0; bool f = false; char ch;
 		while (!isdigit(ch = getchar())) {
			f ^= !(ch ^ '-');
			if (ch == EOF) return false;
		}
		while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch & 15), ch = getchar();
		if (f) x = ~x + 1; return true;
	}
	il int read() {int x; read(x); return x;}
	
	template <typename T> il bool read(pair <T, T> &x) {return read(x.fst) && read(x.snd);}

	template <typename T> il void gmin(T &x, T y) {x = x < y ? x : y;}

 	template <typename T> il void gmax(T &x, T y) {x = x > y ? x : y;}

	template <typename T, typename ...L>
	il bool read(T &x, L &...y) {return read(x) && read(y...);}

	template <typename T> il T lowbit(const T &x) {return x & -x;}
}
using namespace stupid_lrc;
int n, m, pa[MAXN]; vector <char> s[MAXN];
const int mod = 1e9 + 7;

il int fpa(int x) {
	return x ^ pa[x] ? pa[x] = fpa(pa[x]) : x;
}

il void merge(int x, int y) {
	x = fpa(x); y = fpa(y);
	pa[y] = x;
}

il void solve() {
	read(n, m);
	rep1(i, 1, n) s[i].resize(m + 1), scanf("%s", s[i].begin() + 1), pa[i] = i;
	rep1(j, 1, m) {
		vector <int> g; bool f = 0;
		rep1(i, 1, n) {
			if (s[i][j] == '1' && s[i][m + 1 - j] == '1') f = 1;
			if (s[i][j] == '1' || s[i][m + 1 - j] == '1') g.eb(i);
		}
		if (f && g.size() > 1) return puts("0"), void();
		for (auto v : g) merge(v, g[0]);
	} int ans = 1;
	rep1(i, 1, n) if (fpa(i) == i) (ans <<= 1) %= mod;
	printf("%d\n", ans);
}

int main() {
	// freopen("alone.in", "r", stdin);
	// freopen("alone.out", "w", stdout);
	for (int T = read(); T--; ) solve();
	return 0;
}