zoj3329

#include<bits/stdc++.h>
using namespace std;
const int N=555;
double p[30];
double a[N],b[N];
int n,k1,k2,k3,A,B,C;
double p0;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d%d%d%d",&n,&k1,&k2,&k3,&A,&B,&C);
        memset(p,0.0,sizeof(p));
        memset(a,0.0,sizeof(a));
        memset(b,0.0,sizeof(b));
        double hh=k1*k2*k3;
        p0=1.0/hh;
        //memset(a,0.0,sizeof(a));
        //memset(b,0.0,sizeof(b));
        for(int i=1; i<=k1; i++)
        {
            for(int j=1; j<=k2; j++)
            {
                for(int k=1; k<=k3; k++)
                {
                    if(i==A&&j==B&&k==C)
                        continue;
                    else
                        p[i+j+k]+=p0;
                }
            }
        }
        int sum=k1+k2+k3;
        for(int i=n; i>=0; i--)
        {//a[i]=0.0;b[i]=0.0;
            for(int k=3; k<=sum; k++)
            {
                a[i]=a[i]+p[k]*a[i+k];
                b[i]=b[i]+p[k]*b[i+k];
            }
            a[i]+=p0;
            b[i]+=1;
        }
        //printf("a0=%lf b0=%lf\n",a[0],b[0]);
        double ans=b[0]/(1.0-a[0]);
        printf("%.15lf\n",ans);
    }

    return 0;
}