#include<bits/stdc++.h>
using namespace std;
int main()
{
     int tests;
     cin>>tests;
     while(tests--)
     {
         int n,k;
         cin>>n>>k;

         vector<int> ans(n+1);
         int num=n;
         for(int i=2;i<n;i+=2)
         {
              if(k==0)break;
              ans[i]=num--;
              k--;
         }
         if(k)
         {
             cout<<-1<<endl;
             continue;
         }
         int cur=1;
         for(int i=1;i<=n;i++)
         {
             if(!ans[i])
             ans[i]=cur++;
         }

         for(int i=1;i<=n;i++)
         cout<<ans[i]<<" ";
         cout<<endl;
     }
}

#include<bits/stdc++.h>
using namespace std;

void solveTestCase()
{
    int MOD=1e9+7;
    int n;
    cin>>n;
    vector<int> a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    
    int min1=*min_element(a.begin(),a.end());
    int cnt=0;
    
    for(int x:a)
    {
        if(min1==x)cnt++;
        if((min1&x)!=min1)
        {
            printf("0\n");
            return;
        }
    }
    
    int fact=1;
    for(int i=1;i<=n-2;i++)fact=(1LL*fact*i)%MOD;
    int ans=(1LL * cnt * (cnt-1))%MOD;
    ans = (1LL * ans * fact) % MOD;
    printf("%d\n",ans);
}

int main()
{
    int tests;
    cin>>tests;
    while(tests--)
    solveTestCase();
    return 0;
}