#include <iostream>
#include <string>
#include <cassert>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;


const int MN = 11;
const int r = 11;
const int c = 11;
int main() {
	int rr, cc;
	cin >> rr >> cc;
	static double p[MN][MN];
	static int s[MN][MN];
	for (int i = 0; i < rr; i++) {
		for (int j = 0; j < cc; j++) {
			cin >> p[i][j];
			p[i][j] /= 100.0;
		}
	}
	for (int i = 0; i < rr; i++) {
		for (int j = 0; j < cc; j++) {
			cin >> s[i][j];
			s[i][j] = 4-s[i][j];
		}
	}

	double dp1[1<<MN] = {}, dp2[1<<MN] = {};
	double sm = 0;
	dp1[0] = 1.0;
	for (int i = 0; i < r; i++) {
		fill_n(dp2, 1<<MN, 0.0);
		for (int l = 0; l < (1<<c); l++) {
			double pp = 1;
			for (int m = 0; m < c; m++) {
				if (l & (1<<m)) {
					pp *= p[i][m];
				} else {
					pp *= 1.0-p[i][m];
				}
			}
			for (int k = 0; k < (1<<c); k++) {
				int ll = 0;
				bool back = false;
				for (int m = 0; m < c; m++) {
					int u = 0;
					if (l & (1<<m)) u = s[i][m];
					if (back) u++;
					if (k & (1<<m)) u++;
					if (u >= 4) {
						ll |= (1<<m);
						back = true;
					} else {
						back = false;
					}
				}
				back = false;
				for (int m = c-1; m >= 0; m--) {
					int u = 0;
					if (l & (1<<m)) u = s[i][m];
					if (k & (1<<m)) u++;
					if (back) u++;
					if (m && (ll & (1<<(m-1)))) u++;
					if (u >= 4 || (ll & (1<<m))) {
						ll |= (1<<m);
						back = true;
					} else {
						back = false;
					}
				}
				dp2[ll] += dp1[k]*pp;
			}
		}
		for (int j = 0; j < (1<<c); j++) {
			dp1[j] = dp2[j];
			sm += dp2[j] * __builtin_popcount(j);
		}

	}
	printf("%.20lf\n", sm);
	return 0;
}