//人生错乱多如此
#include<bits/stdc++.h>
#define ll long long 
#define N 200005

int n,k;
int a[N];
int pre[N];
int st[N][20];
int _lg[N];
#define inf 1e9

inline int minlen(int x,int y){
	// std::cerr<<x<<" "<<y<<"\n";
	if(x > y)return inf;
	if(x == y)return st[x][0];
	int _L = _lg[y - x + 1];
	return std::min(st[x][_L],st[y - (1ll << _L) + 1][_L]);
}

struct P{int l,op;};

inline int val(int u,P X){
	if(u < X.l){return (u % 2 == 0) ? u - 1 : u + 1;}
	if(u > X.l + 2){return (u % 2 == 0) ? u + 1 : u - 1;}
	if(X.op){if(u == X.l)return X.l + 2;else return u - 1;}
	if(!X.op){if(u == X.l + 2)return X.l;else return u + 1;}
}

bool operator < (P A,P B){
	bool flg = 0;
	if(A.l > B.l)std::swap(A,B),flg = 1;
	int L = std::min(A.l,B.l),R = std::max(B.l + 2,A.l + 2);
	int ind = minlen(A.l + 2,B.l);
	for(int i = A.l;i <= A.l + 2;++i){
		if(val(i,A) != val(i,B)){ind = std::min(ind,st[i][0]);}
	}
	for(int i = B.l;i <= B.l + 2;++i){
		if(val(i,A) != val(i,B)){ind = std::min(ind,st[i][0]);}
	}	
	// if(B.op == 0){ind = std::min(ind,st[B.l + 2][0]);}else{ind = std::min(ind,st[B.l + 2][0]);}
	// if(A.op == 0){ind = std::min(ind,st[A.l + 1][0]);}else{ind = std::min(ind,st[A.l][0]);}
	int ta = val(a[ind],A),tb = val(a[ind],B);
	// std::cout<<A.l<<" "<<A.op<<" "<<B.l<<" "<<B.op<<" "<<ind<<" "<<ta<<" "<<tb<<"\n";
	return (ta < tb) ^ flg;
}

#define inf 1e9

int main(){
	int _ = 1;	
	scanf("%d",&_);
	while(_ -- ){
		scanf("%d%d",&n,&k);
		for(int i = 1;i <= n;++i){scanf("%d",&a[i]);pre[a[i]] = i;st[a[i]][0] = i;}
		_lg[1] = 0;for(int i = 2;i <= n;++i){_lg[i] = _lg[i / 2] + 1;}
		for(int lev = 1;lev < 20;++lev)
		for(int i = 1;i + (1ll << lev) <= n;++i)st[i][lev] = inf;
		for(int lev = 1;lev < 20;++lev){
			for(int i = 1;i + (1ll << lev) - 1 <= n;++i){
				st[i][lev] = std::min(st[i][lev - 1],st[i + (1ll << (lev - 1))][lev - 1]);
			}
		}
		if(n % 2 == 0){
			if(k == 1){for(int i = 1;i <= n;++i){std::cout<<((a[i] % 2 == 0) ? a[i] - 1 : a[i] + 1)<<" ";}puts("");}
			else {puts("-1");}
		}else{
			using std::vector;
			vector<P>ALL;
			for(int i = 1;i + 2 <= n;i += 2){
				P A;A.l = i;A.op = 1;
				ALL.push_back(A);
				A.op = 0;
				ALL.push_back(A);
			}
			std::sort(ALL.begin(),ALL.end());
			// for(auto X : ALL){std::cout<<X.l<<" "<<X.op<<"\n";}
			if(k > ALL.size()){puts("-1");}
			else{for(int i = 1;i <= n;++i){std::cout<<val(a[i],ALL[k - 1])<<" ";}puts("");}
		}
	}
}