#include <bits/stdc++.h>
using namespace std;
void arrange(int arr[], int n, int x)
{
int i, j;
if(x==n)
return;
for(j=x; j<=n-1; j++)
arr[j]= arr[j+1];
}
// void printlist(int arr[], int n)
// {
// int i;
// for(i=1; i<=n; i++)
// cout<<arr[i]<<" ";
// cout<<"\n";
// }
int main(void)
{
int T;
cin>>T;
while(T--)
{
int n, k;
cin>>n>>k;
int arr[n+1], i, count=0, temp=0;
for(i=1; i<=n; i++)
cin>>arr[i];
for(i=1; i<=n-1; i++)
{
if(arr[i]<arr[i+1])
{
arr[i]=-1;
arrange(arr, n, i);
--n;
count++;
temp++;
}
if(count==k)
break;
if(i==n-1)
{
if(count<k && temp!=0)
{
// printlist(arr, n);
temp=0;
i=0;
}
else
break;
}
}
while(count!=k)
--n;
for(i=1; i<=n; i++)
cout<<arr[i]<<" ";
cout<<"\n";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIGFycmFuZ2UoaW50IGFycltdLCBpbnQgbiwgaW50IHgpCnsKCWludCBpLCBqOwoJCglpZih4PT1uKQoJCXJldHVybjsKCWZvcihqPXg7IGo8PW4tMTsgaisrKQoJCWFycltqXT0JYXJyW2orMV07Cn0KCi8vIHZvaWQgcHJpbnRsaXN0KGludCBhcnJbXSwgaW50IG4pCi8vIHsKLy8gCWludCBpOwovLyAJZm9yKGk9MTsgaTw9bjsgaSsrKQovLyAJCWNvdXQ8PGFycltpXTw8IiAiOwovLyAJY291dDw8IlxuIjsKLy8gfQoKaW50IG1haW4odm9pZCkKewoJaW50IFQ7CgljaW4+PlQ7Cgl3aGlsZShULS0pCgl7CgkJaW50IG4sIGs7CgkJY2luPj5uPj5rOwoJCWludCBhcnJbbisxXSwgaSwgY291bnQ9MCwgdGVtcD0wOwoJCQoJCWZvcihpPTE7IGk8PW47IGkrKykKCQkJY2luPj5hcnJbaV07CgoJCWZvcihpPTE7IGk8PW4tMTsgaSsrKQoJCXsKCQkJaWYoYXJyW2ldPGFycltpKzFdKQoJCQl7CgkJCQlhcnJbaV09LTE7CgkJCQlhcnJhbmdlKGFyciwgbiwgaSk7CgkJCQktLW47CgkJCQljb3VudCsrOwoJCQkJdGVtcCsrOwoJCQl9CgkJCWlmKGNvdW50PT1rKQoJCQkJYnJlYWs7CgkJCWlmKGk9PW4tMSkKCQkJewoJCQkJaWYoY291bnQ8ayAgJiYgdGVtcCE9MCkKCQkJCXsKCQkJCQkvLyBwcmludGxpc3QoYXJyLCBuKTsKCQkJCQl0ZW1wPTA7CgkJCQkJaT0wOwoJCQkJfQoJCQkJZWxzZQoJCQkJCWJyZWFrOwoJCQl9CgkJfQoJCXdoaWxlKGNvdW50IT1rKQoJCQktLW47CgkJZm9yKGk9MTsgaTw9bjsgaSsrKQoJCQljb3V0PDxhcnJbaV08PCIgIjsKCQljb3V0PDwiXG4iOwoJfQoKCXJldHVybiAwOwp9CgoK