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

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

	static 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 k = 0; k < (1<<c); k++) {
			for (int l = 0; l < (1<<c); l++) {
				double pp = 1;
				static int u[MN];
				for (int m = 0; m < c; m++) {
					pp *= p[i][m];
					u[m] = 0;
					if (l & (1<<m)) u[m] = s[i][m];
					if (k & (1<<m)) u[m]++;
				}
				queue<int> q;
				for (int m = 0; m < c; m++) {
					if (u[m] >= 4) {
						q.push(m);
					}
				}
				int ll = 0;
				while (!q.empty()) {
					int m = q.front(); q.pop();
					if (ll & (1<<m)) continue;
					ll |= (1<<m);
					if (m > 0) {
						u[m-1]++;
						if (u[m-1] == 4) q.push(m-1);
					}
					if (m < c-1) {
						u[m+1]++;
						if (u[m+1] == 4) q.push(m+1);
					}
				}
				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;
}