#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int t, n, k, s;
cin >> t;
for(int p=0; p < t; p++){
cin >> n >> k;
vector<int> scores;
for(int i=0; i < n; i++){
cin >> s;
scores.push_back(s);
}
sort(scores.begin(), scores.end());
reverse(scores.begin(), scores.end());
int count = 1, rank = 1;
if(n > 1){
for(int j=1; j < n; j++){
if(scores[j] < scores[j-1]){
rank++;
if(rank <= k){
count++;
}
} else {
if(rank <= k){
count++;
}
}
}
cout << count << endl;
} else {
cout << 1;
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgdCwgbiwgaywgczsKCWNpbiA+PiB0OyAKCWZvcihpbnQgcD0wOyBwIDwgdDsgcCsrKXsgCgkJY2luID4+IG4gPj4gazsKCgkgICAgdmVjdG9yPGludD4gc2NvcmVzOwoJICAgIGZvcihpbnQgaT0wOyBpIDwgbjsgaSsrKXsKCSAgICAgICAgY2luID4+IHM7CgkgICAgICAgIHNjb3Jlcy5wdXNoX2JhY2socyk7CgkgICAgfQoJCgkgICAgc29ydChzY29yZXMuYmVnaW4oKSwgc2NvcmVzLmVuZCgpKTsKCSAgICByZXZlcnNlKHNjb3Jlcy5iZWdpbigpLCBzY29yZXMuZW5kKCkpOwoJCgkgICAgaW50IGNvdW50ID0gMSwgcmFuayA9IDE7CgkgICAgaWYobiA+IDEpewoJICAgICAgICBmb3IoaW50IGo9MTsgaiA8IG47IGorKyl7CgkgICAgICAgICAgICBpZihzY29yZXNbal0gPCBzY29yZXNbai0xXSl7CgkgICAgICAgICAgICAgICAgcmFuaysrOwoJICAgICAgICAgICAgICAgIGlmKHJhbmsgPD0gayl7CgkgICAgICAgICAgICAgICAgICAgIGNvdW50Kys7CgkgICAgICAgICAgICAgICAgfSAKCSAgICAgICAgICAgIH0gZWxzZSB7CgkgICAgICAgICAgICAgICAgaWYocmFuayA8PSBrKXsKCSAgICAgICAgICAgICAgICAgICAgY291bnQrKzsKCSAgICAgICAgICAgICAgICB9CgkgICAgICAgICAgICB9CgkgICAgICAgIH0KCSAgICAgICAgY291dCA8PCBjb3VudCA8PCBlbmRsOwoJICAgIH0gZWxzZSB7CgkgICAgICAgIGNvdXQgPDwgMTsKCSAgICB9Cgl9CglyZXR1cm4gMDsKfQ==