package q8xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q846_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
//	String INPUT = "11 11 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ ""
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[][] P = new int[n][];
		for(int i = 0;i < n;i++)P[i] = na(m);
		int[][] S = new int[n][];
		for(int i = 0;i < n;i++)S[i] = na(m);
		
		int[] trans = new int[1<<2*m];
		for(int i = 0;i < 1<<2*m;i++){
			int x = i;
			// 10 -> 00
			for(int j = 0;j < m-1;j++){
				if((x>>>2*j&15) == 4){
					x ^= 4<<2*j;
				}
			}
			// 01 -> 00
			for(int j = m-2;j >= 0;j--){
				if((x>>>2*j&15) == 1){
					x ^= 1<<2*j;
				}
			}
			// 020 -> 000
			for(int j = 0;j < m-2;j++){
				if((x>>>2*j&63) == 8){
					x ^= 8<<2*j;
				}
			}
			for(int j = 0;j < m;j++){
				if((x>>>2*j&3) == 0){
					trans[i] |= 1<<j;
				}
			}
//			tr(i, trans[i]);
		}
		double[] last = new double[1<<m];
		last[0] = 1;
		double E = 0;
		int mask = 0;
		for(int k = 0;k < m;k++)mask = mask<<2|1;
		for(int i = 0;i < n;i++){
			double[] nlast = new double[1<<m];
			for(int j = 0;j < 1<<m;j++){
				double pr = 1;
				for(int k = 0;k < m;k++){
					if(j<<~k<0){
						pr *= (double)P[i][k]/100;
					}else{
						pr *= (double)(100-P[i][k])/100;
					}
				}
				int ss = (1<<2*m)-1;
				int ng = mask;
				for(int k = 0;k < m;k++){
					if(j<<~k<0 && S[i][k] < 4){
						ss ^= 3<<2*k;
						ss ^= S[i][k]<<2*k;
						if(S[i][k] != 0)ng ^= 1<<2*k;
					}
				}
				
				for(int k = mask, l = (1<<m)-1;k >= 0;k--,l--){ k &= mask;
					int ind = ss - (k&~ng);
//					tr(ss, k, ng, k&~ng, ind, trans[ind]);
					nlast[trans[ind]] += pr * last[l];
					E += pr*Integer.bitCount(trans[ind])*last[l];
				}
			}
			last = nlast;
		}
		out.printf("%.14f\n", E);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new Q846_3().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}