#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int R, C;
vector<vector<double> > P;
vector<vi> S;

pair<double, double> memo[11][12][1 << 11][8][2];

pair<double,double> rec(int i, int j, int bag, int pt, int pdep) {
	auto &rr = memo[i][j][bag][pt][pdep];
	if(rr.first == rr.first)
		return rr;
	double &rP = rr.first, &rE = rr.second;

	rP = rE = 0;

	if(j == C) {
		if(pt == 0 && pdep == 0) {
			if(i == R - 1) {
				rP = 1;
				rE = 0;
			} else {
				rer(npt, 0, 7) {
					auto t = rec(i + 1, 0, bag, npt, 0);
					rP += t.first;
					rE += t.second;
				}
			}
		}
		return make_pair(rP, rE);
	}

	int c = pt >= 4;	//最終的に手を挙げるかどうか
	rep(b, 2) {	//最初に知ってたかどうか
		int xpt = 0;
		xpt += b * (4 - S[i][j]);
		if(0 < i) xpt += (bag >> (C - 1) & 1);
		int nbag = ((bag << 1) & ~(1 << C)) | c;
		double p = b == 1 ? P[i][j] : 1 - P[i][j];
		int deppt = pt < 4 ? 0 : max(0, 4 - xpt);
		rer(npt, 0, 7) {
			bool left = 0 < j && (bag >> 0 & 1);
			bool right = npt >= 4;
			if(xpt + left + right != pt) continue;
			int ndep = max(0, deppt - (left && pdep == 0 ? 1 : 0));
			if(ndep > (right ? 1 : 0)) continue;
			auto t = rec(i, j + 1, nbag, npt, ndep);
			rP += t.first * p;
			rE += (t.second + t.first * c) * p;
		}
	}

	return make_pair(rP, rE);
}

int main() {
	while(~scanf("%d%d", &R, &C)) {
		P.assign(R, vector<double>(C));
		S.assign(R, vi(C));
		rep(i, R) rep(j, C) {
			int p;
			scanf("%d", &p);
			P[i][j] = p / 100.;
		}
		rep(i, R) rep(j, C) {
			scanf("%d", &S[i][j]);
		}

		mset(memo, -1);
		double rP = 0, rE = 0;
		rer(pt, 0, 7) {
			auto t = rec(0, 0, 0, pt, 0);
			rP += t.first;
			rE += t.second;
		}
		double ans = rE;
		printf("%.10f\n", ans);
	}
	return 0;
}