#include<bits/stdc++.h>
using namespace std;
int m,n,flag,sx,sy,ex,ey,vis[15][15],mapp[15][15],sum;
void dfs(int x,int y){
    //cout<<vis[x][y]<<" "<<x<<" "<<y<<endl;
    if (x==ex&&y==ey){
        sum++;
        sum%=100000000;
        return;
    }
    int xx,yy;
    if (y==n){
        xx=x+1,yy=1;
    }else{
        xx=x,yy=y+1;
    }
    if (!vis[xx-1][yy]&&!vis[xx][yy-1]&&mapp[xx][yy]){
        for (int i=0;i<=1;i++){
            vis[xx][yy]=i;
            dfs(xx,yy);
            vis[xx][yy]=0;
        }
    }else{
        dfs(xx,yy);
    }
}
int main(){
    freopen("cowfood.in","r",stdin);
    freopen("cowfood.out","w",stdout);
    scanf("%d%d",&m,&n);
    for (int i=1;i<=m;i++){
        for (int j=1;j<=n;j++){
            scanf("%d",&mapp[i][j]);
            if (mapp[i][j]==1){
                if (flag==0){
                    flag=1;
                    sx=i,sy=j;
                }
                ex=i,ey=j;
            }
            
        }
    }
    for (int i=0;i<=1;i++){
        vis[sx][sy]=i;
        dfs(sx,sy);
        vis[sx][sy]=0;
    }
    printf("%d",sum);
    return 0;
}