#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int query_kth(const int *A,int na,const int *B,int nb,const int *C,int nc,int k){
int a=0,b=0,c=0;
int mn,t;
for (;k;k-=t+1){
t=(k-2)/3;
int s1=(a+t>na?1<<30:A[a+t]);
int s2=(b+t>nb?1<<30:B[b+t]);
int s3=(c+t>nc?1<<30:C[c+t]);
mn=min(s1,min(s2,s3));
if (s1==mn) a+=t+1;
else if (s2==mn) b+=t+1;
else c+=t+1;
}
return mn;
}