#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int r, c; cin>>r>>c;
  double p[11][11]; int s[11][11]={};
  for(int i=0; i<r; i++) for(int j=0; j<c; j++) cin>>p[i][j];
  for(int i=0; i<r; i++) for(int j=0; j<c; j++) cin>>s[i][j];
  double dp[12][1<<11]={};
  dp[0][0]=1;
  double ans=0;
  double q[11][1<<11];
  for(int i=0; i<r; i++){
    for(int k=0; k<(1<<c); k++){
        q[i][k]=1;
        for(int l=0; l<c; l++){
          if(k&(1<<l)){
            q[i][k]*=p[i][l]/100;
          }else{
            q[i][k]*=(100-p[i][l])/100;
          }
        }
    }
  }
  for(int i=0; i<r; i++){
    for(int j=0; j<(1<<c); j++){
      if(dp[i][j]==0) continue;
      for(int k=0; k<(1<<c); k++){
        int cnt[11]={};
        bool used[11]={};
        int que[30];
        int t=0, u=0, m=0;
        for(int l=0; l<c; l++){
          if(k&(1<<l)) cnt[l]=4-s[i][l];
          else continue;
          if(j&(1<<l)) cnt[l]++;
          if(cnt[l]>=4){
            que[u]=l; u++;
            used[l]=1;
            m^=(1<<l);
          }
        }
        while(t<u){
          int x=que[t]; t++;
          if(x>0 && !used[x-1] && cnt[x-1]>=2){
            cnt[x-1]++;
            if(cnt[x-1]>=4 && !used[x-1]){
              que[u]=x-1; u++;
              used[x-1]=1;
              m^=(1<<(x-1));
            }
          }
          if(x<c-1 && !used[x+1] && cnt[x+1]>=2){
            cnt[x+1]++;
            if(cnt[x+1]>=4){
              que[u]=x+1; u++;
              used[x+1]=1;
              m^=(1<<(x+1));
            }
          }
        }
        dp[i+1][m]+=q[i][k]*dp[i][j];
        ans+=q[i][k]*dp[i][j]*popcount(m);
      }
    }
  }
  printf("%.9lf\n", ans);
	return 0;
}