#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <cassert>
#include <climits>
#include <bitset>
#include <functional>
#include <iomanip>
#include <random>

#define FOR_LT(i, beg, end) for (int i = (int)(beg); i < (int)(end); i++)
#define FOR_LE(i, beg, end) for (int i = (int)(beg); i <= (int)(end); i++)
#define FOR_DW(i, beg, end) for (int i = (int)(beg); (int)(end) <= i; i--)
#define REP(n)              for (int repeat_index = 0; repeat_index < (int)n; repeat_index++)

using namespace std;

const int MAX_ROW = 2510; // to be set appropriately
const int MAX_COL = 2510; // to be set appropriately
struct BitMatrix {
    int H, W;
    bitset<MAX_COL> val[MAX_ROW];
    BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
    inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};

int GaussJordan(BitMatrix& A, bool is_extended = false) {
    int rank = 0;
    for (int col = 0; col < A.W; ++col) {
        if (is_extended && col == A.W - 1) break;
        int pivot = -1;
        for (int row = rank; row < A.H; ++row) {
            if (A[row][col]) {
                pivot = row;
                break;
            }
        }
        if (pivot == -1) continue;
        swap(A[pivot], A[rank]);
        for (int row = 0; row < A.H; ++row) {
            if (row != rank && A[row][col]) A[row] ^= A[rank];
        }
        ++rank;
    }
    return rank;
}

BitMatrix M(2510, 2510);

int linear_equation(BitMatrix& A, vector<int>& b, vector<int>& res) {
    int m = A.H, n = A.W;
    M.H = m;
    M.W = n + 1;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) M[i][j] = A[i][j];
        M[i][n] = b[i];
    }
    int rank = GaussJordan(M, true);

    // check if it has no solution
    for (int row = rank; row < m; ++row) if (M[row][n]) return -1;

    // answer
    res.assign(n, 0);
    for (int i = 0; i < rank; ++i) res[i] = M[i][n];
    return rank;
}

void setA(BitMatrix& A, int h, int w, int ox, int oy, int x, int y, int dir)
{
    int dirs[8][2] = {
        {1, 0},
        {-1, 0},
        {0, 1},
        {0, -1},
        {1, 1},
        {1, -1},
        {-1, 1},
        {-1, -1 },
    };

    int cx = x + dirs[dir][0];
    int cy = y + dirs[dir][1];

    if (cx < 0 || w <= cx || cy < 0 || h <= cy) {
        return;
    }

    int po =oy * w + ox;
    int p = cy * w + cx;
    A[po][p] = 1;
    setA(A, h, w, ox, oy, cx, cy, dir);
}

int64_t pow_rem(int64_t x, int64_t m, int64_t rem)
{
    if (m == 0) {
        return 1;
    }
    if (m == 1) {
        return x;
    }

    if (m & 1) {
        int64_t val = pow_rem(x, m / 2, rem);
        val = val * val;
        val %= rem;
        val *= x;
        val %= rem;
        return val;
    }
    else {
        int64_t val = pow_rem(x, m / 2, rem);
        val = val * val;
        val %= rem;
        return val;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout << fixed << setprecision(20);

    int h, w; cin >> h >> w;
    int n = h * w;

    BitMatrix A(n, n);
    {
        FOR_LT(y, 0, h) {
            FOR_LT(x, 0, w) {
                int p = y * w + x;
                A[p][p] = 1;
                FOR_LT(i, 0, 8) {
                    setA(A, h, w, x, y, x, y, i);
                }
            }
        }
    }

    vector<int> b(n);
    {
        FOR_LT(y, 0, h) {
            FOR_LT(x, 0, w) {
                int p = y * w + x;
                int f; cin >> f;
                if (f) b[p] = 1;
            }
        }
    }

    vector<int> res(n);
    int r = linear_equation(A, b, res);
    if (r == -1) {
        cout << 0 << endl;
        return 0;
    }

    cout << pow_rem(2, n - r, 1000000009) << endl;

    return 0;
}


Measured memory_bytes: 4796