import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;

static void solve(){
 int n=ir.nextInt(),m=ir.nextInt();
 int[][] p=new int[n][],s=new int[n][];
 int[] se=new int[1<<(m*2)],co=new int[m],bit=new int[1<<m];
 double[][] dp=new double[2][1<<m];
 for(int i=0;i<n;i++) p[i]=ir.nextIntArray(m);
 for(int i=0;i<n;i++) s[i]=ir.nextIntArray(m);
 for(int i=0;i<1<<(m*2);i++){
  int mask=i;
  ArrayDeque<Integer> que=new ArrayDeque<>();
  for(int j=0;j<m;j++){
   co[j]=mask&3;
   mask>>=2;
   if(co[j]==0) que.add(j);
  }
  int ss=0;
  while(!que.isEmpty()){
   int t=que.poll();
   ss|=1<<t;
   if(t!=0){
    co[t-1]--;
    if(co[t-1]==0) que.add(t-1);
   }
   if(t!=m-1){
    co[t+1]--;
    if(co[t+1]==0) que.add(t+1);
   }
  }
  se[i]=ss;
 }
 for(int i=0;i<1<<m;i++) bit[i]=Integer.bitCount(i);
 double ans=0.0;
 dp[0][0]=1.0;
 for(int r=0;r<n;r++){
  for(int ma1=0;ma1<1<<m;ma1++){
   double prob=1.0;
   HashSet<Integer> st=new HashSet<>();
   int fi=0;
   for(int i=0;i<m;i++){
    prob*=((ma1&(1<<i))!=0)?(double)p[r][i]/100:1.0-(double)p[r][i]/100;
    if((ma1&(1<<i))!=0) st.add(i);
    else fi|=3<<(2*i);
   }
   for(int ma2=0;ma2<((r==0)?1:1<<m);ma2++){
    if(dp[r%2][ma2]*prob==0) continue;
    int mask=fi;
    for(int c : st){
     int res=s[r][c];
     if((ma2&(1<<c))!=0) res--;
     res=Math.max(Math.min(res,3),0);
     mask|=res<<(2*c);
    }
    dp[(r%2)^1][se[mask]]+=dp[r%2][ma2]*prob;
   }
  }
  for(int i=0;i<1<<m;i++) ans+=dp[(r%2)^1][i]*bit[i];
  Arrays.fill(dp[r%2],0.0);
 }
 out.printf("%.15f\n",ans);
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;

 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }

 public double nextDouble(){return Double.parseDouble(next());}

 public BigInteger nextBigInteger(){return new BigInteger(next());}

 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }

 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }

 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}