#include <bits/stdc++.h>
using namespace std;
const int oo = 1e2 + 2;
int n, k;
int a[oo];
map<int, int> mp;
void solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
k = n - k + 1;
// tim mex cua k so dau
int mex = 0;
for (int i = 1; i <= k; i++) {
mp[a[i]] = 1;
}
for (int i = 0; i <= k; i++) {
if (mp[i] != 1) {
mex = i;
break;
}
}
if (mex == k) {
cout << -1 << '\n';
return;
}
// swap vi tri cua mex va max cua k so dau
int maxPos = 0;
int mx = 0;
int mexPos = 0;
for (int i = 1; i <= k; i++) {
if (a[i] >= mx) {
mx = a[i];
maxPos = i;
}
}
for (int i = 1; i <= n; i++) {
if (a[i] == mex) {
mexPos = i;
break;
}
}
cout << maxPos <<" "<< mexPos << '\n';
mp.clear();
}
int main() {
int t;
cin >> t;
while(t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgb28gPSAxZTIgKyAyOwoKaW50IG4sIGs7CmludCBhW29vXTsKbWFwPGludCwgaW50PiBtcDsKCnZvaWQgc29sdmUoKSB7CgljaW4gPj4gbiA+PiBrOwoJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSB7CgkJY2luID4+IGFbaV07Cgl9CgkKCWsgPSBuIC0gayArIDE7CgkKCS8vIHRpbSBtZXggY3VhIGsgc28gZGF1CglpbnQgbWV4ID0gMDsKCWZvciAoaW50IGkgPSAxOyBpIDw9IGs7IGkrKykgewoJCW1wW2FbaV1dID0gMTsKCX0KCQoJZm9yIChpbnQgaSA9IDA7IGkgPD0gazsgaSsrKSB7CgkJaWYgKG1wW2ldICE9IDEpIHsKCQkJbWV4ID0gaTsKCQkJYnJlYWs7CgkJfQoJfQoJCglpZiAobWV4ID09IGspIHsKCQljb3V0IDw8IC0xIDw8ICdcbic7CgkJcmV0dXJuOwoJfQoJCgkKCS8vIHN3YXAgdmkgdHJpIGN1YSBtZXggdmEgbWF4IGN1YSBrIHNvIGRhdQoJaW50IG1heFBvcyA9IDA7CglpbnQgbXggPSAwOwoJaW50IG1leFBvcyA9IDA7Cglmb3IgKGludCBpID0gMTsgaSA8PSBrOyBpKyspIHsKCQlpZiAoYVtpXSA+PSBteCkgewoJCQlteCA9IGFbaV07CgkJCW1heFBvcyA9IGk7CgkJfQoJfQoJCglmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspIHsKCQlpZiAoYVtpXSA9PSBtZXgpIHsKCQkJbWV4UG9zID0gaTsKCQkJYnJlYWs7CgkJfQoJfQoJCgljb3V0IDw8IG1heFBvcyA8PCIgIjw8IG1leFBvcyA8PCAnXG4nOwoJbXAuY2xlYXIoKTsKfQoKaW50IG1haW4oKSB7CgkKCWludCB0OwoJY2luID4+IHQ7Cgl3aGlsZSh0LS0pIHsKCQlzb2x2ZSgpOwoJfQoJCglyZXR1cm4gMDsKfQ==