#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 11, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;

int h, w;
double p[MX][MX];
int s[MX][MX];
double dp[MX+1][1<<MX];

int main() {
  scanf("%d%d",&h,&w);
  rep(i,h)rep(j,w) cin >> p[i][j], p[i][j] /= 100;
  rep(i,h)rep(j,w) cin >> s[i][j];
  double ans = 0;
  dp[0][0] = 1;
  rep(i,h) {
    rep(k,1<<w) {
      vi a(w,4);
      double q = 1;
      rep(l,w) if (k>>l&1) q *= p[i][l]; else q *= (1-p[i][l]);
      rep(l,w) if (k>>l&1) a[l] -= 4-s[i][l];
      drep(j,w) if (k>>j&1) {
        for (int l = k;; l = (l-1)&k) {
          if (!(l>>j&1)) dp[i][l] -= dp[i][l|1<<j];
          if (l == 0) break;
        }
      }
      for (int j = k;; j = (j-1)&k) {
        int nj = 0;
        vi b = a;
        rep(l,w) if (j>>l&1) b[l]--;
        bool up = true;
        while (up) {
          up = false;
          rep(l,w) if (!(nj>>l&1)) {
            if (b[l] <= 0) {
              up = true;
              nj |= 1<<l;
              if (l) b[l-1]--;
              if (l+1 < w) b[l+1]--;
            }
          }
        }
        dp[i+1][nj] += dp[i][j]*q;
        if (j == 0) break;
      }
      rep(j,w) if (k>>j&1) {
        for (int l = k;; l = (l-1)&k) {
          if (!(l>>j&1)) dp[i][l] += dp[i][l|1<<j];
          if (l == 0) break;
        }
      }
    }
    rep(k,1<<w) ans += dp[i+1][k]*pcnt(k);
    rep(j,w)rep(k,1<<w) if (!(k>>j&1)) dp[i+1][k] += dp[i+1][k|1<<j];
  }
  printf("%.10f\n", ans);
  return 0;
}