#include<bits/stdc++.h>
#define ll long long
#define el '\n'
#define all(a) a.begin(),a.end()

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template<typename T>

using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N=1e5+5,mod=1e9+7;
ll n ,m ;

bool is_corner_cell(ll x ,ll y)
{
    if (n == 1)
    {
        return x == 0 || x == n-1;
    }
    if (m == 1)
    {
        return y == 0 || y == m-1;
    }
    return false;
}

void solve(ll t) {
    cin >> n >> m;

    int counts[3] = {0,0,0};
    int arr[n][m];
    for (ll i = 0 ; i < n ; i ++)
    {
        for (ll j = 0 ,x ; j < m ; j ++)
        {
            cin >> x;
            arr[i][j] = x;
            counts[x]++;
        }
    }

    if (counts[0] >= 2)
    {
        cout << 0 ;
        return;
    }

    if (counts[0] == 1)
    {
        if (n == 1 || m == 1)
        {
            if (arr[0][0] == 1 || arr[n-1][m-1] == 1)
            {
                cout << 1 ;
                return;
            }
            cout << 2;
            return;
        }
        else
        {
            if (counts[1] >= 1) {cout << 1; return;}
            cout << 2; return;
        }


    }

    // zeros == 0

    if (counts[2] % 2 == 0)
    {
        cout << 0;
        return;
    }

    ll half = counts[2]/2;
    long long a = (long long )(1LL << half);
    cout << a ;

}
int main() {
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    ll t;
    //cin >> t;
    t = 1;
    for (ll i = 0 ; i < t ; i ++)
    {
        solve(t);
    }
}