1 //HDOJ 3853
 2 #include<cmath>
 3 #include<cstdio>
 4 #define F(i,j,n) for(int i=j;i<=n;++i)
 5 #define D(i,j,n) for(int i=j;i>=n;--i)
 6 
 7 const int N=1100,INF=~0u>>2;
 8 const double eps=1e-5;
 9 double f[N][N],p[N][N][3];
10 
11 int main(){
12     int n,m;
13     while(scanf("%d%d",&n,&m)!=EOF){
14         F(i,1,n) F(j,1,m) F(k,0,2)
15             scanf("%lf",&p[i][j][k]);
16         f[n][m]=0;
17         D(i,n,1)
18             D(j,m,1){
19                 if (i==n && j==m) continue;
20                 if (fabs(1-p[i][j][0])<eps) continue;
21                 double *P=p[i][j];
22                 f[i][j]=2/(1-P[0]) + f[i][j+1]*P[1]/(1-P[0]) + f[i+1][j]*P[2]/(1-P[0]);
23             }
24         printf("%.3lf\n",f[1][1]);
25     }
26     return 0;
27 }