#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        if(n%2==0){
            cout<<-1<<endl;
            continue;
        }
        for(int i=1;i<=n;i+=2){
            cout<<i<<" ";
        }
        for(int i=2;i<=n;i+=2){
            cout<<i<<" ";
        }
        cout<<endl;
    }
    return 0;
}

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

bool canMakeUniversal(string s, int k) {
    int n = s.length();
    string rev = s;
    reverse(rev.begin(), rev.end());
    
    // If already universal, no swaps needed
    if (s < rev) return true;
    
    // Count mismatched pairs where s[i] > s[n-1-i]
    int requiredSwaps = 0;
    bool canBeUniversal = false;
    
    for (int i = 0; i < n/2; i++) {
        int j = n - 1 - i;
        
        if (s[i] < s[j]) {
            // Found a position where s becomes lexicographically smaller than its reverse
            canBeUniversal = true;
            break;
        } 
        else if (s[i] > s[j]) {
            requiredSwaps++;
        }
        // If equal, need to continue checking
    }
    
    // If string is a palindrome (s == rev), need to find if we can make a beneficial swap
    if (!canBeUniversal && requiredSwaps == 0) {
        // Check if there are at least two different characters
        bool hasDifferentChars = false;
        for (int i = 0; i < n-1 && !hasDifferentChars; i++) {
            for (int j = i+1; j < n; j++) {
                if (s[i] != s[j]) {
                    hasDifferentChars = true;
                    break;
                }
            }
        }
        
        // For a palindrome with different chars, one swap is enough
        if (hasDifferentChars) {
            return k >= 1;
        } else {
            // All characters are the same, impossible to make universal
            return false;
        }
    }
    
    // Return true if we can perform the required swaps
    return canBeUniversal || requiredSwaps <= k;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int t;
    cin >> t;
    
    while (t--) {
        int n, k;
        string s;
        cin >> n >> k >> s;
        
        if (canMakeUniversal(s, k)) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }
    
    return 0;
}