1 #include<stdio.h>
 2 #include<iostream>
 3 #include<string.h>
 4 #include<algorithm>
 5 #define pri 100000000
 6 using namespace std;
 7 int m, n;
 8 int farm[15][15];
 9 int dp[1<<13][15];
10 bool judge(int i,int pos)//判断状态i在牧场第pos行是否合法
11 {
12     int now = n;
13     int last = 0;
14     while (now)
15     {
16         int num = i % 2;
17         if (!farm[pos][now] && num || (last && num)) return 0;
18         last = num;
19         i /= 2;
20         now--;
21     }
22     return 1;
23 }
24 bool judge_state(int i,int j)//判断状态i和j能否放在牧场上下相邻的两行
25 {
26     int now = n;
27     while (now)
28     {
29         if ((i % 2) && (j % 2)) return 0;
30         i /= 2;
31         j /= 2;
32         now--;
33     }
34     return 1;
35 }
36 int getdp()
37 {
38     memset(dp, 0, sizeof(dp));
39     for (int i = 0; i < (1<<n); i++)//初始化第一行
40         if (judge(i, 1)) dp[i][1] = 1;
41     for (int i = 2; i <= m; i++)//枚举牧场剩下的每一行
42         for (int j = 0; j < (1<<n); j++) if (judge(j, i))//枚举该行可行的状态
43             for (int k = 0; k < (1<<n); k++) if (dp[k][i-1])//枚举上一行可行的状态
44                 if (judge_state(j, k))
45                 {
46                     dp[j][i] += dp[k][i-1];
47                     dp[j][i] %= pri;
48                 }
49     int res = 0;
50     for (int i = 0; i < (1<<n); i++)
51     {
52         res += dp[i][m];
53         res %= pri;
54     }
55     return res;
56
57 }
58 int main()
59 {
60     scanf("%d%d", &m, &n);
61     for (int i = 1; i <= m; i++)
62         for (int j = 1; j <= n; j++)
63             scanf("%d", &farm[i][j]);
64     printf("%d", getdp());
65     return 0;
66 }