#include<iostream>
#include<cstring>
#include<vector>

using namespace std;

typedef long long LL;

const int N = 14, M = 1 << 12;
const int mod = 1e8;

int n, m;
int g[N];
vector<int> state;
vector<int> head[M];
LL f[N][M];

bool check(int x)
{
    for (int i = 0; i < n; i ++)
        if ((x >> i & 1) && (x >> i + 1 & 1))
            return false;
    return true;
}

int main()
{
    cin >> m >> n;
    for (int i = 1; i <= m; i ++)
        for (int j = 0; j < n; j ++) {
            int t;
            cin >> t;
            g[i] += !t << j;
        }
    for (int i = 0; i < 1 << n; i ++)
        if (check(i))
            state.push_back(i);
    for (auto a : state)
        for (auto b :state) {
            if ((a & b) == 0)
                head[a].push_back(b);
        }
    f[0][0] = 1;
    for (int i = 1; i <= m + 1; i ++)
        for (auto a : state) {
            if (g[i] & a)
                continue;
            for (auto b : head[a]) {
                if (g[i - 1] & b)
                    continue;
                f[i][a] = (f[i][a] + f[i - 1][b]) % mod;
            }
        }
    cout << f[m + 1][0] << endl;
    return 0;
}