#include <bits/stdc++.h>

#define int long long

void solve() {
    const int mod = 1e9 + 7;

    int r, c;
    std::cin >> r >> c;
    std::map<std::set<int>, int> f;

    std::vector<std::vector<std::set<int>>> a(r, std::vector<std::set<int>>(2));

    for (int i = 0; i < r; i++) {
        std::string s;
        std::cin >> s;
        for (int j = 0; j < c; j++) {
            if (s[j] == '1') a[i][0].insert(j), a[i][1].insert(c - j - 1);
        }
    }

    // f[a[0][0]] = f[a[0][1]] = 1;
    std::set<int> st;
    f[st] = 1;

    for (int i = 0; i < r; i++) {
        std::map<std::set<int>, int> g;

        for (int j = 0; j <= 1; j++) {
            for (auto &[mp, cnt] : f) {
                bool flag = true;
                for (auto &x : a[i][j]) {
                    if (mp.count(x)) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    auto mp1 = mp;
                    for (auto &x : a[i][j]) {
                        mp1.insert(x);
                    }
                    g[mp1] += (f[mp] ) ;
                    g[mp1]%=mod;
                }
            }
        }

        std::swap(f, g);
    }

    int ans = 0;
    for(auto &[mp, cnt] : f) ans += cnt;
    std::cout << ans << '\n';
}

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

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    std::cin >> t;

    for (int i = 0; i < t; ++i) {
        solve();
    }

    return 0;
}