#include<bits/stdc++.h>
#define ll long long
#define MAXN (int)1e5+10
int a[MAXN],b[MAXN],c[MAXN],s[MAXN];
using namespace std;
int main(){
   int k,d,m,f; cin>>k>>d>>m>>f;
   for(int i=1;i<=k;i++) scanf("%d",&s[i]);
   for(int i=1;i<=d;i++) scanf("%d",&a[i]);
   for(int i=1;i<=m;i++) scanf("%d",&b[i]);
   for(int i=1;i<=f;i++) scanf("%d",&c[i]);
   sort(s+1,s+1+k);
   sort(a+1,a+1+d);
   sort(b+1,b+1+m);
   sort(c+1,c+1+f);
   
   int q; cin>>q;
   int aaa=d,bbb=m,ccc=f,ss=k;
   while(q--){
      ll sum=s[ss--];
      int aa,bb,cc; scanf("%d %d %d",&aa,&bb,&cc);
      while(aa--) sum+=a[aaa--];
      while(bb--) sum+=b[bbb--];
      while(cc--) sum+=c[ccc--];
      printf("%.2f\n",(double)sum/11);
   }
   return 0;
}