#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

// BIT セグ木 遅延セグ木 のみ

// from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9
// (based on AtCoder STL)

#include <algorithm>
#include <array>
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}
}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <numeric>
#include <type_traits>

namespace atcoder {

namespace internal {

#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type,
std::false_type>::type;

template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type,
std::false_type>::type;

template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value,
__uint128_t,
unsigned __int128>;

template <class T>
using is_integral = typename std::conditional<std::is_integral<T>::value ||
is_signed_int128<T>::value ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;

template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
                                                 std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type,
std::false_type>::type;

template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
                           std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;

template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value,
make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type>::type;

#else

template <class T> using is_integral = typename std::is_integral<T>;

template <class T>
using is_signed_int =
typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
std::true_type,
std::false_type>::type;

template <class T>
using is_unsigned_int =
typename std::conditional<is_integral<T>::value &&
std::is_unsigned<T>::value,
std::true_type,
std::false_type>::type;

template <class T>
using to_unsigned = typename std::conditional<is_signed_int<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type;

#endif

template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;

template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;

template <class T> using to_unsigned_t = typename to_unsigned<T>::type;

}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <vector>

namespace atcoder {

template <class T> struct fenwick_tree {
    using U = internal::to_unsigned_t<T>;
    
public:
    fenwick_tree() : _n(0) {}
    fenwick_tree(int n) : _n(n), data(n) {}
    
    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += U(x);
            p += p & -p;
        }
    }
    
    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }
    
private:
    int _n;
    std::vector<U> data;
    
    U sum(int r) {
        U s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

}  // namespace atcoder


#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
namespace atcoder {

template <class S,
S (*op)(S, S),
S (*e)(),
class F,
S (*mapping)(F, S),
F (*composition)(F, F),
F (*id)()>
struct lazy_segtree {
public:
    lazy_segtree() : lazy_segtree(0) {}
    lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
    
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    
    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }
    
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();
        
        l += size;
        r += size;
        
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push(r >> i);
        }
        
        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        
        return op(sml, smr);
    }
    
    S all_prod() { return d[1]; }
    
    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;
        
        l += size;
        r += size;
        
        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }
        
        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }
        
        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }
    
    template <bool (*g)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return g(x); });
    }
    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= _n);
        assert(g(e()));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (g(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
    
    template <bool (*g)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return g(x); });
    }
    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= _n);
        assert(g(e()));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
    
private:
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;
    
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
};

}  // namespace atcoder

#include <algorithm>
#include <cassert>
#include <vector>

namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
    
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    
    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }
    
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
        
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
    
    S all_prod() { return d[1]; }
    
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
    
    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
    
private:
    int _n, size, log;
    std::vector<S> d;
    
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

using T=pair<int,int>;

T f(T a,T b){
    return min(a,b);
}

T ti(){
    return mp(INF,INF);
}

vi gutyoku(vi Q,int K){
    int N=si(Q);
    if(N%2==0){
        if(K>1) return {-1};
        for(int i=0;i<N;i++){
            Q[i]^=1;
        }
        return Q;
    }else{
        if(K>N-1) return {-1};
        
    }
    vvi ans;
    vi P(N);iota(all(P),0);
    do{
        int d=0;
        for(int i=0;i<N;i++){
            if(P[i]==Q[i]) d=INF;
            else d+=abs(Q[i]-P[i]);
        }
        if(d==N+1){
            ans.pb(P);
        }
    }while(next_permutation(all(P)));
    
    return ans[K-1];
}
vi solve(vi P,int K){
    int N=si(P);
    if(N%2==0){
        if(K>1) return {-1};
        for(int i=0;i<N;i++){
            P[i]^=1;
        }
        return P;
    }
    
    if(K>N-1) return {-1};
    K--;
    
    vii S;
    for(int i=0;i<N-2;i+=2){
        S.pb(mp(i,1));
        S.pb(mp(i,2));
    }
    
    vi Q(N);
    for(int i=0;i<N;i++){
        Q[P[i]]=i;
    }
    
    vector<T> def(N);
    for(int i=0;i<N;i++){
        def[i]=mp(Q[i],i);
    }
    atcoder::segtree<T,f,ti> seg(def);
    
    sort(all(S),[&](auto x,auto y){
        if(x.fi==y.fi){
            int po=min({Q[x.fi],Q[x.fi+1],Q[x.fi+2]});
            if(P[po]==x.fi) return x.se<y.se;
            else if(P[po]==x.fi+1) return x.se>y.se;
            else return x.se<y.se;
        }else{
            int ss,tt;
            int l=min(x.fi,y.fi),r=max(x.fi,y.fi)+2;
            vi chan;
            while(1){
                auto [a,b]=seg.prod(l,r+1);
                
                int s,t;
                
                if(b<x.fi){
                    s=b^1;
                }else if(b<=x.fi+2){
                    if(x.se==1){
                        if(b==x.fi) s=x.fi+1;
                        else if(b==x.fi+1) s=x.fi+2;
                        else s=x.fi;
                    }else{
                        if(b==x.fi) s=x.fi+2;
                        else if(b==x.fi+1) s=x.fi;
                        else s=x.fi+1;
                    }
                }else{
                    if(b%2==0) s=b-1;
                    else s=b+1;
                }
                
                swap(x,y);
                swap(s,t);
                if(b<x.fi){
                    s=b^1;
                }else if(b<=x.fi+2){
                    if(x.se==1){
                        if(b==x.fi) s=x.fi+1;
                        else if(b==x.fi+1) s=x.fi+2;
                        else s=x.fi;
                    }else{
                        if(b==x.fi) s=x.fi+2;
                        else if(b==x.fi+1) s=x.fi;
                        else s=x.fi+1;
                    }
                }else{
                    if(b%2==0) s=b-1;
                    else s=b+1;
                }
                swap(x,y);
                swap(s,t);
                
                if(s!=t){
                    ss=s;
                    tt=t;
                    break;
                }
                
                seg.set(b,mp(INF,b));
                chan.pb(b);
            }
            
            
            for(int x:chan){
                seg.set(x,mp(Q[x],x));
            }
            return ss<tt;
        }
    });
    
    auto x=S[K];
    
    vi ans(N);
    for(int i=0;i<N;i++){
        int b=P[i];
        int s;
        if(b<x.fi){
            s=b^1;
        }else if(b<=x.fi+2){
            if(x.se==1){
                if(b==x.fi) s=x.fi+1;
                else if(b==x.fi+1) s=x.fi+2;
                else s=x.fi;
            }else{
                if(b==x.fi) s=x.fi+2;
                else if(b==x.fi+1) s=x.fi;
                else s=x.fi+1;
            }
        }else{
            if(b%2==0) s=b-1;
            else s=b+1;
        }
        ans[i]=s;
    }
    
    return ans;
    /*
    K--;
    
    int L=0,R=N-1;
    int st=-1;
    vi ans=P;
    
    for(int i=0;i<N;i++){
        if(P[i]<L||R<P[i]) continue;
        vector<array<int,3>> cand;
        for(int x=P[i]-2;x<=P[i];x++){
            if(L<=x&&(x-L)%2==0&&x+2<=R){
                if(x!=P[i]) cand.pb({x,x,1});
                if(x+1!=P[i]) cand.pb({x+1,x,1});
                if(x+2!=P[i]) cand.pb({x+2,x,1});
            }
        }
        for(int x=P[i]-1;x<=P[i];x++){
            if(L<=x&&x+1<=R){
                if((x-L)%2==0){
                    if(R-(x+1)>=3){
                        if(x==P[i]-1) cand.pb({x,-1,(R-(x+1))/2*2});
                        else cand.pb({x+1,-1,(R-(x+1))/2*2});
                    }
                }else{
                    if(x-L>=3){
                        if(x==P[i]-1) cand.pb({x,-2,(x-L)/2*2});
                        else cand.pb({x+1,-2,(x-L)/2*2});
                    }
                }
            }
        }
        
        sort(all(cand));
    }
     */
}
int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    /*
    for(int N=3;N<=9;N+=2){
        vi P(N);iota(all(P),0);
        do{
            for(int K=1;K<=N-1;K++){
                auto a=solve(P,K),b=gutyoku(P,K);
                assert(a==b);
            }
        }while(next_permutation(all(P)));
        cout<<N<<endl;
    }
    
    for(int N=3;N<=9;N+=2){
        vi P(N);iota(all(P),0);
        vi dis(N*N+4);
        for(int x:P) cout<<x<<" ";
        cout<<endl;
        vvi r;
        do{
            int d=0;
            for(int i=0;i<N;i++){
                if(P[i]==i) d=INF;
                else d+=abs(i-P[i]);
            }
            if(d==N+1){
                r.pb(P);
            }
        }while(next_permutation(all(P)));
        reverse(all(r));
        for(int i=0;i+1<si(r);i+=2) swap(r[i],r[i+1]);
        for(auto q:r){
            for(int x:q) cout<<x<<" ";
            cout<<endl;
        }
        cout<<endl;
    }
     */
    
    int Q;cin>>Q;
    while(Q--){
        int N,K;cin>>N>>K;
        vi P(N);
        for(int i=0;i<N;i++){
            cin>>P[i];P[i]--;
        }
        auto Q=solve(P,K);
        if(Q[0]==-1) cout<<-1<<"\n";
        else{
            for(int x:Q) cout<<x+1<<" ";
            cout<<"\n";
        }
    }
}