#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;
int n, m;
vector<array<string, 2>> a(n + 10);
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;
}

int dfs(int pos, string x) {
     //cout <<pos << " " << x << " " << a[pos][0] << " " << a[pos][1] << endl;
    if(pos > n) return 1;
    string tmp = x;
    
   
    int res = 0;
    int flag = 1;
    for(int j = 0; j < m; j++) {
        if(a[pos][0][j] == '1' && x[j] == '1') {
            flag = 0;
            break;
        }
    } 
    if(flag) {
        for(int j = 0; j < m; j++) {
            if(a[pos][0][j] == '1') {
                tmp[j] = '1';
            }
        }
        res += dfs(pos + 1, tmp);
    }
    tmp = x;
    flag = 1;
    for(int j = 0; j < m; j++) {
        if(a[pos][1][j] == '1' && x[j] == '1') {
            flag = 0;
            break;
        }
    }
    if(flag) {
        for(int j = 0; j < m; j++) {
            if(a[pos][1][j] == '1') {
                tmp[j] = '1';
            }
        }
        res += dfs(pos + 1, tmp);
    }
    return res % mod;
}

void solve() {
    cin >> n >> m;
    
    for (int i = 1; i <= n; ++i) {
        cin >> a[i][0];
        a[i][1] = a[i][0];
        reverse(a[i][1].begin(), a[i][1].end());
    }
    string x;
    for(int i = 1; i <= m; i++) {
        x.push_back('0');
    }
    cout << dfs(1, x) << 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();
}