def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    R = int(input[idx])
    idx += 1
    C = int(input[idx])
    idx += 1

    P = []
    for _ in range(R):
        row = list(map(int, input[idx:idx+C]))
        P.append([p / 100.0 for p in row])
        idx += C

    S = []
    for _ in range(R):
        row = list(map(int, input[idx:idx+C]))
        S.append(row)
        idx += C

    X = [[0.0 for _ in range(C)] for __ in range(R)]
    threshold = 1e-9
    max_iter = 1000000

    for _ in range(max_iter):
        X_new = [row[:] for row in X]
        max_delta = 0.0

        for i in range(R):
            for j in range(C):
                p = P[i][j]
                s = S[i][j]
                neighbors = []
                if i > 0:
                    neighbors.append((i-1, j))
                if j > 0:
                    neighbors.append((i, j-1))
                if j < C-1:
                    neighbors.append((i, j+1))
                n = len(neighbors)
                total = 0.0

                for mask in range(1 << n):
                    bits = bin(mask).count('1')
                    if bits >= s:
                        prob = 1.0
                        for k in range(n):
                            ni, nj = neighbors[k]
                            if mask & (1 << k):
                                prob *= X[ni][nj]
                            else:
                                prob *= (1 - X[ni][nj])
                        total += prob

                new_val = p * total
                delta = abs(X[i][j] - new_val)
                if delta > max_delta:
                    max_delta = delta
                X_new[i][j] = new_val

        if max_delta < threshold:
            break
        X = X_new

    expected = 0.0
    for i in range(R):
        for j in range(C):
            expected += X[i][j]

    print("{0:.10f}".format(expected))

if __name__ == "__main__":
    main()