#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define IO ios_base::sync_with_stdio(0), cin.tie(0)
const int mod = 1e9 + 7;
template <typename T>
void readArray(vector<T> &A)
{
    for (T &i : A)
        cin >> i;
}
template <typename T>
void readArray(vector<vector<T>> &A)
{
    for (vector<T> &i : A)
        readArray(i);
}
template <typename T>
void printArray(vector<T> A)
{
    for (T i : A)
        cout << i << " ";
    cout << endl;
}
ll fastPow(ll a, ll b, ll m = mod)
{
    a %= m;
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}
bool isPrime(ll n, int iter = 5)
{
    if (n < 4)
        return n == 2 || n == 3;
    for (int i = 0; i < iter; i++)
    {
        int a = 2 + rand() % (n - 3);
        if (fastPow(a, n - 1, n) != 1)
            return false;
    }
    return true;
}
ll inv(ll n, ll m = mod)
{
    return fastPow(n, m - 2);
}
ll mul(ll a, ll b, ll m = mod)
{
    return (a * b) % m;
}
ll add(ll a, ll b, ll m = mod)
{
    return (a + b + m) % m;
}
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int>> A(n, vector<int>(m));
    readArray(A);
    vector<int> cnt(3);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cnt[A[i][j]]++;
        }
    }
    if (n == 1)
    {
        ll ans = 1e18;
        ll sma = 1;
        for (int j = 0; j < m - 1; j++)
        {
            sma *= A[0][j];
            ll smb = 1;
            for (int k = j + 1; k < m; k++)
            {
                smb *= A[0][k];
            }
            ans = min(ans, abs(sma - smb));
        }
        cout << ans;
    }
    else if (m == 1)
    {
        ll ans = 1e18;
        ll sma = 1;
        for (int j = 0; j < n - 1; j++)
        {
            sma *= A[j][0];
            ll smb = 1;
            for (int k = j + 1; k < n; k++)
            {
                smb *= A[k][0];
            }
            ans = min(ans, abs(sma - smb));
        }
        cout << ans;
    }
    else
    {
        if (cnt[0] >= 2)
            cout << 0;
        else if (cnt[0] == 1)
        {
            if (cnt[1])
                cout << 1;
            else if (cnt[2])
                cout << 2;
            else
                cout << 0;
        }
        else
        {
            if (cnt[2] % 2 == 0)
                cout << 0;
            else
                cout << (1ll << (cnt[2] / 2));
        }
    }
}
void trials()
{
    int t, tt;
    for (cin >> t, tt = t; t--; cout << endl)
    {
        // cout << "Case #" << tt - t << ": ";
        solve();
    }
}
int main()
{
    // freopen("","r",stdin);
    IO;
    solve();
}