#include <stdio.h>

 #include <algorithm>

 #include <string.h>

 #include <iostream>

 using namespace std;

 typedef long long ll;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 /********************************************************************/

 const int mod = ;

 const int maxn = ;

 int n, m;

 int dp[][(<<)+];

 int a[maxn];

 int line(int x, int y){

     if((a[x]&y) != y) return ;

     if((y&(y<<)) != ) return ;

     return ;

 }

 int main(){

     int n,m;

     while(~scanf("%d%d",&n,&m)){

         for(int i=;i<=n;i++){

             a[i]=;

             for(int j=;j<=m;j++){

                 int t;

                 scanf("%d",&t);

                 a[i]=(a[i]<<)+t;

             }

         }

         memset(dp,,sizeof(dp));

         dp[][] = ;

         for(int i = ;i <= n;i++){

             for(int j=;j<(<<m);j++){

                 if(line(i,j)==)continue;

                 for(int k=;k<(<<m);k++){

                     if((j&k)==){

                         dp[i][j]=dp[i][j]+dp[i-][k];

                         dp[i][j]%=mod;

                     }

                 }

             }

         }

         int ans = ;

         for(int i = ;i < (<<m);i++){

             ans= (ans + dp[n][i] )%mod;

         }

         printf("%d\n",ans);

     }

 }