#include <bits/stdc++.h>
using namespace std;
int pros[10001], cons[10001], P, C;
int bid(int num) {
return lower_bound(pros, pros+P, num) + C - lower_bound(cons, cons+C, num);
}
int main() {
int T;
cin >> T;
while(T--) {
int L = 0, R, M1, M2;
cin >> P;
for(int i = 0; i < P; i++)
cin >> pros[i];
sort(pros, pros+P);
cin >> C;
for(int i = 0; i < C; i++)
cin >> cons[i];
sort(cons, cons+C);
R = 1 + (cons[C-1] > pros[P-1] ? cons[C-1] : pros[P-1]);
while(L < R) {
M1 = (2*L+R)/3;
M2 = (L+2*R)/3;
cout << L << ", " << M1 << ", " << M2 << ", " << R << endl;
if(bid(M1) < bid(M2))
R = M2-1;
else
L = M1+1;
}
cout << L << endl;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgcHJvc1sxMDAwMV0sIGNvbnNbMTAwMDFdLCBQLCBDOwppbnQgYmlkKGludCBudW0pIHsKCXJldHVybiBsb3dlcl9ib3VuZChwcm9zLCBwcm9zK1AsIG51bSkgKyBDIC0gbG93ZXJfYm91bmQoY29ucywgY29ucytDLCBudW0pOwp9CgppbnQgbWFpbigpIHsKCWludCBUOwoJY2luID4+IFQ7Cgl3aGlsZShULS0pIHsKCQlpbnQgTCA9IDAsIFIsIE0xLCBNMjsKCQljaW4gPj4gUDsKCQlmb3IoaW50IGkgPSAwOyBpIDwgUDsgaSsrKQoJCQljaW4gPj4gcHJvc1tpXTsKCQlzb3J0KHByb3MsIHByb3MrUCk7CgkJY2luID4+IEM7CgkJZm9yKGludCBpID0gMDsgaSA8IEM7IGkrKykKCQkJY2luID4+IGNvbnNbaV07CgkJc29ydChjb25zLCBjb25zK0MpOwoJCVIgPSAxICsgKGNvbnNbQy0xXSA+IHByb3NbUC0xXSA/IGNvbnNbQy0xXSA6IHByb3NbUC0xXSk7CgkJd2hpbGUoTCA8IFIpIHsKCQkJTTEgPSAoMipMK1IpLzM7CgkJCU0yID0gKEwrMipSKS8zOwoJCQljb3V0IDw8IEwgPDwgIiwgIiA8PCBNMSA8PCAiLCAiIDw8IE0yIDw8ICIsICIgPDwgUiA8PCBlbmRsOwoJCQlpZihiaWQoTTEpIDwgYmlkKE0yKSkKCQkJCVIgPSBNMi0xOwoJCQllbHNlCgkJCQlMID0gTTErMTsKCQl9CgkJY291dCA8PCBMIDw8IGVuZGw7Cgl9CglyZXR1cm4gMDsKfQ==
0, 8, 17, 26
0, 5, 10, 16
6, 9, 12, 16
6, 7, 9, 11
8, 9, 10, 11
10, 10, 10, 11
11