#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define debug(x) cerr << #x << " is " << x << endl;
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define one(x) __builtin_popcount(x)
#define ld long double
#define sz(x) x.size()
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
const int N = 1400000;
unsigned ll cnt[3];
void doWork(){
    int r, c;
    cin >> r >> c;
    for(int i = 0; i < r; ++i){
        for(int j = 0; j < c; ++j){
            int x;
            cin >> x;
            cnt[x]++;
        }
    }
    if(cnt[0] >= 2 || (cnt[1] && !cnt[2] && !cnt[0]) || (cnt[2]%2 == 0 && !cnt[0])){
        cout << 0 << endl;
    }
    else if(cnt[0] == 1){
        if(cnt[1]){
            cout << 1 << endl;
        }
        else if(!cnt[1] && cnt[2]){
            cout << 2 << endl;
        }
    }
    else{
        ll B = pow(2ll, (cnt[2] / 2));
        cout << B << endl;
    }
}
int32_t main(){
    FastIO
    int tc = 1;
    //cin >> tc;
    while(tc--){
        doWork();
    }
    return 0;
}