#include<bits/stdc++.

h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;
#define sz(a) a.size()
#define inf (1000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000*1000*1000+7)
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
#define flush fflush(stdout)
#define lli long long int
#define pb push_back
#define pob pop_back
#define rep(i,a,b) for(lli i=a;i<b;i++)
#define repv(a,b) for(int i=a;i>=b;i--)
#define itr vector<lli> :: iterator
#define maximum(a,b,c) max(a,max(b,c))
#define minimum(a,b,c) min(a,min(b,c))
#define tim clock_t

inline void fast()

{
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<lli> ws[1000];
void solve_ws()
{
lli s=1,aga=11,sidha = 5;

}
int main()
{
fast();
lli t,k,n;
string s;
cin>>t;
map<char,lli> mp;
while(t--)
 {
cin>>n>>k;
cin>>s;
mp.clear();
for(auto it:s)
{
if(mp[it]<k)
{
cout<<it;
}
mp[it]+=1;

}
cout<<endl;
}
return 0;
}