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

const int mod = 100000000;

int dp[15][1<<13];
bitset<1<<13>legal;
int init[14];
int n,m,temp,maxn,sum;

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",&temp);
            init[i]=(init[i]<<1)+temp;
        }
    }
    maxn=(1<<n)-1;
    for(int i=0;i<=maxn;i++){
        if(!(i&i<<1)&&!(i&i>>1)){
            legal[i]=1;
        }
    }
    dp[0][0]=1;
    for(int i=1;i<=m;i++){
        for(int j=0;j<=maxn;j++){
            if(legal[j]&&(j&init[i])==j){
                for(int k=0;k<=maxn;k++){
                    if(!(k&j))dp[i][j]=(dp[i-1][k]+dp[i][j])%mod;
                }
            }
        } 
    }
    for(int i=0;i<=maxn;i++){
        sum=(sum+dp[m][i])%mod;
    }
    printf("%d",sum);
    return 0;
}