#include <bits/stdc++.h>

using namespace std;

int cnt=0;
int len,c;
void swap(int i,int j, int *a){
    int temp = a[i];
    a[i] = a[j];
    a[j] = temp;
}


void quicksort(int *arr, int left, int right){
   // cout<<"QS:"<<left<<","<<right<<"\n";
    cnt++;
    if(cnt-1==c)
        return;
    int i = left;
    int j = right;
    int pivot = arr[left];

    while(left<j || i<right)
    {
        while(arr[i]<pivot)
        i++;
        while(arr[j]>pivot)
        j--;

        if(i<=j){
            swap(i,j,arr);
            i++;
            j--;
        }
        else{
            if(left<j)
                quicksort(arr, left, j);
            if(i<right)
                quicksort(arr,i,right);
            return;
        }
    }
}
int main(){
    int q;
    cin >> q;
    //while(q){
        cnt=0;
        cin>>len>>c;
        int arr[len];
        for(int i=0;i<len;i++)
            arr[i]=i+1;
       // quicksort(arr,0,len-1);
       // for(int i=0;i<len;i++)
           // cout<<arr[i]<<" ";
       // cout<<endl;
       // cout<<1<<endl;
        cout<<4<<" "<<2<<" "<<1<<" "<<3<<" "<<5<<" "<<endl;
        cout<<-1;
       
        q--;
   // }
    return 0;
}