// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INTINF (int)(1152921504606846976)
#define int long long
#define MAXN 200010
#define BIT(X,I) ((X&(1<<I))>0)
#define P 1000000007

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int _; cin >> _;
    while (_--) {
        int n, k; cin >> n >> k;
        vector<int> a(n);
        vector<vector<int>> dp(n, vector<int>(64, 0));
        rep(i, 0, n) cin >> a[i];
        dp[0][a[0]] = 1;
        rep(i, 1, n) {
            dp[i][a[i]] = 1;
            rep(j, 0, 64) {
                dp[i][j] = (dp[i][j] + dp[i-1][j]) % P;
                dp[i][j & a[i]] = (dp[i][j & a[i]] + dp[i-1][j]) % P;
            }
        }
        int ans = 0;
        rep(i, 0, 64) {
            int cnt = 0;
            rep(j, 0, 7) cnt += BIT(i, j);
            if (cnt == k) ans = (ans + dp[n-1][i]) % P;
        }
        cout << ans << endl;
    }

    return 0;
}