#include<cstdio>#include<cstring>#include<algorithm>#define maxn 105usingnamespace std;longdouble p[maxn][8][8][8], f[maxn][8][8][8];int k, A, B, C, T;intmain(){scanf("%d",&T);while(T--){scanf("%d%d%d%d",&k,&A,&B,&C);memset(f,0,sizeof f);memset(p,0,sizeof p);
p[0][A][B][C]=1.0;for(int i =0; i < k; i++){for(int a =0; a <=7; a++){for(int b =0; a + b <=7; b++){for(int c =0; a + b + c <=7; c++){longdouble P =(longdouble)1.0/(a + b + c +1);if(a !=0){
f[i +1][a -1][b][c]+= f[i][a][b][c]* P * a;
p[i +1][a -1][b][c]+= p[i][a][b][c]* P * a;}if(b !=0){
f[i +1][a +1][b -1][min(a + b + c +1,7)- a - b]+= f[i][a][b][c]* P * b;
p[i +1][a +1][b -1][min(a + b + c +1,7)- a - b]+= p[i][a][b][c]* P * b;}if(c !=0){
f[i +1][a][b +1][min(a + b + c +1,7)- a - b -1]+= f[i][a][b][c]* P * c;
p[i +1][a][b +1][min(a + b + c +1,7)- a - b -1]+= p[i][a][b][c]* P * c;}
f[i +1][a][b][c]+=(f[i][a][b][c]+ p[i][a][b][c])* P;
p[i +1][a][b][c]+= p[i][a][b][c]* P;}}}}longdouble ans =0;for(int a =0; a <=7; a++)for(int b =0; b <=7; b++)for(int c =0; c <=7; c++)
ans += f[k][a][b][c];printf("%.2lf\n",(double)ans);}return0;}