#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 
int main(){
    ll h,w;cin >> h >> w;
    vector<vector<double>> g(h,vector<double>(w));
    rep(i,h){
        rep(j,w)cin >> g[i][j],g[i][j]/=100;
    }
    vvl s(h,vl(w));
    rep(i,h)rep(j,w)cin >> s[i][j];
    vector<double> dp(1<<w);dp[0]=1;
    double ans=0;
    rep(i,h){
        vector<double> ndp(1<<w);
        vector<double> prob(1<<w,1);
        rep(cit,1<<w){
            rep(j,w){
                if(cit>>j&1)prob[cit]*=g[i][j];
                else prob[cit]*=1.0-g[i][j];
            }
        }
        rep(bit,1<<w){
            if(dp[bit]==0)continue;
            rep(cit,1<<w){
                ll to=0;//実際に手を挙げている
                rep(j,w){
                    ll now=(cit>>j&1? 4-s[i][j]:0);
                    if(bit>>j&1)now++;
                    if(j&&(to>>(j-1)&1))now++;
                    if(j<w-1&&(to>>(j+1)&1))now++;
                    if(now>=4)to|=(1<<j);
                }
                per(j,w){
                    ll now=(cit>>j&1? 4-s[i][j]:0);
                    if(bit>>j&1)now++;
                    if(j&&(to>>(j-1)&1))now++;
                    if(j<w-1&&(to>>(j+1)&1))now++;
                    if(now>=4)to|=(1<<j);
                }
                ndp[to]+=dp[bit]*prob[cit];
                ans+=dp[bit]*prob[cit]*(__builtin_popcount(to));
                /*if(ndp[to]==-1)ndp[to]=(dp[bit]+__builtin_popcount(to))*prob;
                else ndp[to]+=(dp[bit]+__builtin_popcount(to))*prob;*/
            }
        }
        swap(dp,ndp);
    }
    CST(10);
    cout << ans << endl;
}