1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <algorithm>
 5 typedef long long ll;
 6 using namespace std;
 7 const ll mod = 100000000;
 8 ll f[2][1 << 13];
 9 bool g[15][15];
10 int n,m,r,cur=0;
11
12 void dfs(int pos,int val,ll add)
13 {
14   if (pos == -1)
15    f[cur][val] = (f[cur][val] + add) % mod;
16   else
17    {
18          if (val >> pos & 1 || !g[r][pos]) //上一行的这个位置已经放了地雷 / 这个地方不允许放地雷
19           dfs(pos-1,val & ~(1 << pos),add);
20          else
21           {
22                 dfs(pos-1,val | (1 << pos),add);
23                 dfs(pos-1,val,add);
24        }
25    }
26 }
27
28
29 bool check(int x)
30 {
31    int pre = 0;
32    for(int i = 0 ; i < m ; ++ i)
33     {
34         int newx = x >> i & 1;
35         if (newx && pre)
36          return false;
37         pre = newx;
38     }
39    return true;
40 }
41
42 int main(int argc,char *argv[])
43 {
44   memset(g,true,sizeof(g));
45   memset(f,0,sizeof(f));
46   scanf("%d%d",&n,&m);
47   for(int i = 0 ; i < n ; ++ i)
48    for(int j = 0 ; j < m ; ++ j)
49     {
50         int temp;
51         scanf("%d",&temp);
52         if (!temp)
53          g[i][j] = false;
54     }
55   r = 0;
56   dfs(m-1,0 , 1);
57   for(int i = 1 ; i < n ; ++ i)
58     {
59        cur ^= 1;
60        r = i;
61        for(int j = 0 ; j < (1 << m) ; ++ j) f[cur][j] = 0;
62        for(int j = 0 ; j < (1 << m) ; ++ j)
63         if (check(j))
64          dfs(m-1,j,f[cur^1][j]);
65       }
66   int ans = 0;
67   for(int i = 0 ; i < (1 << m) ; ++ i)
68    if (check(i))
69     ans = (ans + f[cur][i]) % mod;
70   printf("%lld\n",ans % mod);
71   return 0;
72 }