// #include <bits/stdc++.h>
#include <iostream>

using namespace std;

#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=1;i<n;++i)

#define Real double
#define EPS (Real)(1e-12)

int h,w;
#define MAX_H 11
#define MAX_W 11
Real p[MAX_H][MAX_W];
int s[MAX_H][MAX_W];
Real result;
// Real raised[2][1<<MAX_W];
// int bef,nxt;
Real raised[MAX_H+1][1<<MAX_W];
bool know[MAX_W];
int raising;
bool raisings[MAX_W];
int active[MAX_W];

int main(){
  // INPUT
  cin>>h>>w;
  REP(i,h)REP(j,w){
    cin>>p[i][j];
    p[i][j]/=100.0;
  }
  REP(i,h)REP(j,w){
    cin>>s[i][j];
    s[i][j] = 4-s[i][j];
  }
  result = 0.0;
  raised[0][0] = 1.0;
  REP(i,h){
    // if know then bit 1, else then bit 0
    REP(nowmask,1<<w){
      Real rate = 1.0;
      REP(j,w){
        if(nowmask>>j & 1 == 1){
          rate *= p[i][j];
          know[j] = true;
        }else{
          rate *= (1.0-p[i][j]);
          know[j] = false;
        }
      }
      if(rate<EPS)continue;

      REP(beforemask,1<<w){
        if(raised[i][beforemask]<EPS)continue;

        REP(j,w){
          raisings[j] = false;
          active[j] = s[i][j]+(int)(beforemask>>j&1==1);
        }
        REP(j,w){
          if( active[j]>=4 && know[j] ){
            raisings[j] = true;
          }
        }
        // from front & left
        REPR(j,w){
          if( !raisings[j] && active[j]>=3 && know[j] && raising>>(j-1)&1==1 ){
            raisings[j] = true;
          }
        }
        // from front & right
        REPR(_j,w){
          int j = w-1-_j;
          if( !raisings[j] && active[j]>=3 && know[j] && raising>>(j+1)&1==1 ){
            raisings[j] = true;
          }
        }
        // from front & left & right
        REPR(j,w-1){
          if( !raisings[j] && active[j]>=2 && know[j] &&
            raising>>(j-1)&1==1 && raising>>(j+1)&1==1 ){
            raisings[j] = true;
          }
        }
        raising = 0;
        REP(j,w){
          raising <<= 1;
          if(raisings[w-1-j])raising += 1;
        }
        raised[i+1][raising] += rate*raised[i][beforemask];
      }
    }
  }
  REP(mask,1<<w){
    int cnt = __builtin_popcount(mask);
    REP(i,h) result += raised[i+1][mask]*cnt;
  }

  cout.precision(15);
  cout << fixed << result << endl;
  return 0;
}