def main(): import sys input = sys.stdin.read().split() ptr = 0 R = int(input[ptr]) ptr += 1 C = int(input[ptr]) ptr += 1 P = [] for _ in range(R): row = list(map(int, input[ptr:ptr + C])) ptr += C P.append([p / 100.0 for p in row]) S = [] for _ in range(R): row = list(map(int, input[ptr:ptr + C])) ptr += C S.append(row) # Initialize E with zeros E = [[0.0 for _ in range(C)] for _ in range(R)] threshold = 1e-9 max_iter = 1000000 converged = False for _ in range(max_iter): max_diff = 0.0 # Update each cell for i in range(R): for j in range(C): current = E[i][j] # Determine front, left, right's E pF = 0.0 if i > 0: pF = E[i-1][j] pL = 0.0 if j > 0: pL = E[i][j-1] pR = 0.0 if j < C - 1: pR = E[i][j+1] S_ij = S[i][j] Q = 0.0 for F in [0, 1]: for L in [0, 1]: for R_ in [0, 1]: s_sum = F + L + R_ if s_sum >= S_ij: prob = ((pF if F else (1 - pF)) * (pL if L else (1 - pL)) * (pR if R_ else (1 - pR))) Q += prob R_val = 0.0 for F in [0, 1]: for L in [0, 1]: for R_ in [0, 1]: s_sum = F + L + R_ if s_sum >= 4: prob = ((pF if F else (1 - pF)) * (pL if L else (1 - pL)) * (pR if R_ else (1 - pR))) R_val += prob new_E = P[i][j] * Q + (1 - P[i][j]) * R_val diff = abs(new_E - current) if diff > max_diff: max_diff = diff E[i][j] = new_E if max_diff < threshold: break total = 0.0 for i in range(R): for j in range(C): total += E[i][j] print("{0:.10f}".format(total)) if __name__ == "__main__": main()