#include <bits/stdc++.h>
using namespace std;

int const Mod=100000000;
int n,m,cnt,res,d[20][20];
int mk[20][20];

void dfs(int x,int y){
    if (x==n && y==m){
        if (!d[x][y-1] && !d[x-1][y] && mk[x][y]) res++;
        res++,res%=Mod;
        return;
    }
    if (y>m) x++,y=1;
    d[x][y]=0;
    dfs(x,y+1);
    if (!d[x][y-1] && !d[x-1][y] && mk[x][y]){
        d[x][y]=1;
        dfs(x,y+1);
        d[x][y]=0;
    }
    return;
}

int main(){
    freopen("cowfood.in","r",stdin);
    freopen("cowfood.out","w",stdout);
    
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            scanf("%d",&mk[i][j]);
        } 
    }
    d[1][1]=0;
    dfs(1,1);
    printf("%d",res);
    
    return 0;
}