#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    int r, c;
    cin >> r >> c;

    int g[r][c];
    int z = 0, o = 0, t = 0, x;
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            cin >> x;

            g[i][j] = x;

            if (!x)
                z++;
            else if (x == 1)
                o++;
            else
                t++;
        }
    }

    if (z >= 2) {
        cout << 0;

        return;
    }

    if (z == 1) {
        if (!o)
            cout << 2;
        else {
            if (r > 1 && c > 1)
                cout << 1;
            else if (g[r - 1][c - 1] == 1 || g[0][0] == 1)
                cout << 1;
            else
                cout << 2;
        }

        return;
    }

    if (t % 2 == 0)
        cout << 0;
    else
        cout << (1LL << (t / 2));
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}