import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); } int M, N; real[][] P; int[][] S; void main() { try { for (; ; ) { M = readInt(); N = readInt(); P = new real[][](M, N); foreach (x; 0 .. M) foreach (y; 0 .. N) { P[x][y] = readInt() / 100.0; } S = new int[][](M, N); foreach (x; 0 .. M) foreach (y; 0 .. N) { S[x][y] = readInt(); } auto prob = new real[][](M, 1 << N); foreach (x; 0 .. M) { foreach (a; 0 .. 1 << N) { prob[x][a] = 1.0; foreach (y; 0 .. N) { prob[x][a] *= ((a >> y) & 1) ? P[x][y] : (1.0 - P[x][y]); } } } auto dp = new real[][](M + 1, 1 << N); foreach (x; 0 .. M + 1) { dp[x][] = 0.0; } dp[0][0] = 1.0; foreach (x; 0 .. M) { foreach (b; 0 .. 1 << N) { if (isNormal(dp[x][b])) { foreach (a; 0 .. 1 << N) { int bb; foreach (y; 0 .. N) { if ((a >> y) & 1) { if ((4 - S[x][y]) + ((b >> y) & 1) + ((y - 1 >= 0) ? ((bb >> (y - 1)) & 1) : 0) + ((bb >> (y + 1)) & 1) >= 4) { bb |= 1 << y; } } } foreach_reverse (y; 0 .. N) { if ((a >> y) & 1) { if ((4 - S[x][y]) + ((b >> y) & 1) + ((y - 1 >= 0) ? ((bb >> (y - 1)) & 1) : 0) + ((bb >> (y + 1)) & 1) >= 4) { bb |= 1 << y; } } } dp[x + 1][bb] += dp[x][b] * prob[x][a]; } } } } real ans = 0.0; foreach (x; 0 .. M) { foreach (b; 0 .. 1 << N) { ans += dp[x + 1][b] * popcnt(b); } } writefln("%.20f", ans); } } catch (EOFException e) { } }