#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; }

struct DP {
	typedef pair<double, double> T;
	vector<T> dp;
	void init(int C) {
		dp.assign((1 << C) * 8 * 2, T());
	}
	T &operator()(int bag, int pdep, int pt) {
		return dp[(bag * 2 + pdep) * 8 + pt];
	}
	void swap(DP &that) {
		dp.swap(that.dp);
	}
};

int main() {
	int R, C;
	while(~scanf("%d%d", &R, &C)) {
		vector<vector<double> > P(R, vector<double>(C));
		vector<vi> S(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]);

		DP dp, ndp;
		ndp.init(C);
		rer(pt, 0, 7)
			ndp(0, 0, pt).first += 1;
		rep(i, R) rep(j, C) {
			dp.swap(ndp);
			ndp.init(C);
			rep(bag, 1 << C) rep(pdep, 2) rer(pt, 0, 7) {
				auto x = dp(bag, pdep, pt);
				if(x.first < 1e-99) continue;
				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;
					int deppt = pt < 4 ? 0 : max(0, 4 - xpt);
					bool left = 0 < j && (bag >> 0 & 1);
					int ndep = max(0, deppt - (left && pdep == 0 ? 1 : 0));
					if(ndep >= 2) continue;

					double prob = b == 1 ? P[i][j] : 1 - P[i][j];
					double xf = prob * x.first;
					double xs = prob * (x.second + x.first * c);
					auto yp = &ndp(nbag, ndep, 0);
					if(j == C - 1) {
						if(xpt + left == pt && ndep == 0) {
							rer(npt, 0, 7)
								yp[npt].first += xf, yp[npt].second += xs;
						}
					} else {
						if(xpt + left + 0 == pt && ndep == 0) {
							rer(npt, 0, 3)
								yp[npt].first += xf, yp[npt].second += xs;
						}
						if(xpt + left + 1 == pt && ndep <= 1) {
							rer(npt, 4, 7)
								yp[npt].first += xf, yp[npt].second += xs;
						}
					}
				}
			}
		}
		double ans = 0, total = 0;
		rep(bag, 1 << C) {
			auto t = ndp(bag, 0, 0);
			total += t.first;
			ans += t.second;
		}
//		cerr << "total = " << total << endl;
		printf("%.10f\n", ans);
	}
	return 0;
}