#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

double P[11][11];
int S[11][11], pts[11];
double dp0[1 << 11], dp1[1 << 11];
double pr[11][11];
int dst[1 << 11];

int main() {
    int r, c;
    cin >> r >> c;
    cin.ignore();
    rep (i, r) rep (j, c) {
        cin >> P[i][j];
        P[i][j] /= 100;
    }
    cin.ignore();
    rep (i, r) rep (j, c) cin >> S[i][j];

    double ans = 0;
    dp0[0] = 1;
    queue<int> q;
    rep (i, r) {
        memset(dp1, 0, sizeof(dp1));
        rep (t, 1 << c) {
            double pr = 1;
            rep (j, c) {
                if (t & 1 << j) pr *= P[i][j];
                else pr *= 1 - P[i][j];
            }
            memset(dst, -1, sizeof(dst));
            rep (s, 1 << c) {
                if (dst[s & t] == -1) {
                    memset(pts, 0, sizeof(pts));
                    double pr = 1;
                    rep (j, c) {
                        if (t & 1 << j) pts[j] += 4 - S[i][j];
                        if (s & 1 << j) pts[j]++;
                    }
                    int u = 0;
                    rep (j, c) if (pts[j] >= 4) q.push(j);
                    while (!q.empty()) {
                        int j = q.front(); q.pop();
                        u |= 1 << j;
                        if (j - 1 >= 0) {
                            pts[j - 1]++;
                            if (pts[j - 1] == 4) {
                                q.push(j - 1);
                            }
                        }
                        if (j + 1 < c) {
                            pts[j + 1]++;
                            if (pts[j + 1] == 4) {
                                q.push(j + 1);
                            }
                        }
                    }
                    dst[s & t] = u;
                }
                dp1[dst[s & t]] += dp0[s] * pr;
            }
        }
        swap(dp0, dp1);
        rep (s, 1 << c) {
            ans += __builtin_popcount(s) * dp0[s];
        }
    }
    printf("%.20f\n", ans);
    return 0;
}