#include <bits/stdc++.h>
#define MOD 998244353
#define mod 1000000007
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define range(i,a,b) for (int i = a; i <= b; i++)
#define round(i,a,b) for (int i = a; i < b; i++)
#define rrange(i,a,b) for (int i = a; i >= b; i--)
#define rround(i,a,b) for (int i = a; i > b; i--)
using namespace std;
struct formation
{
    int a,b,c;
}fmt[100005];
int K,D,M,F,q,i,k[100005],d[100005],m[100005],f[100005];
int SumOf_k()
{
    return k[K - 1];
}
int SumOf_d(int n)
{
    int j,sum = 0;
    rround(j,D - 1,D - 1 - n) sum += d[j];
    return sum;
}
int SumOf_m(int n)
{
    int j,sum = 0;
    rround(j,M - 1,M - 1 - n) sum += m[j];
    return sum;
}
int SumOf_f(int n)
{
    int j,sum = 0;
    rround(j,F - 1,F - 1 - n) sum += f[j];
    return sum;
}
int main()
{
	scanf("%d %d %d %d",&K,&D,&M,&F);
	round(i,0,K) cin >> k[i];
	sort(k,k + K);
	round(i,0,D) cin >> d[i];
	sort(d,d + D);
	round(i,0,M) cin >> m[i];
	sort(m,m + M);
	round(i,0,F) cin >> f[i];
	sort(f,f + F);
	cin >> q;
	double ave[q];
	round(i,0,q) cin >> fmt[i].a >> fmt[i].b >> fmt[i].c;
	round(i,0,q) ave[i] = (SumOf_k() + SumOf_d(fmt[i].a) + SumOf_m(fmt[i].b) + SumOf_f(fmt[i].c)) / 10.0;
	round(i,0,q) printf("%.2lf\n",ave[i]);
    return 0;
}