#include <bits/stdc++.h>
#define endl '\n'
#define el '\n'
#define ll long long
#define fast                 \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
using namespace std;

void solve()
{
    int n, m;
    cin >> n >> m;
    int grid[n][m], ones = 0, twos = 0, zeroes = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> grid[i][j];
            if (grid[i][j] == 1)
                ones++;
            else if (grid[i][j] == 2)
                twos++;
            else
                zeroes++;
        }
    }
    if(n == 1)
    {
        ll pref[m], suff[m];
        pref[0] = grid[0][0];
        suff[m-1] = grid[0][m-1];
        for(int i = 1;i<m;i++)
        {
            pref[i] = pref[i-1] * grid[0][i];
        }
        for(int i = m-2;i>=0;i--)
        {
            suff[i] = suff[i+1] * grid[0][i];
        }
        ll ans = INT64_MAX;
        for(int i = 0;i<m-1;i++)
        {
            ans = min(ans, abs(pref[i]-suff[i + 1]));
        }
        cout<<ans<<el;
    } else if(m==1)
    {
         ll pref[n], suff[n];
        pref[0] = grid[0][0];
        suff[n-1] = grid[n - 1][0];
        for(int i = 1;i<n;i++)
        {
            pref[i] = pref[i-1] * grid[i][0];
        }
        for(int i = n-2;i>=0;i--)
        {
            suff[i] = suff[i+1] * grid[i][0];
        }
        ll ans = INT64_MAX;
        for(int i = 0;i<n-1;i++)
        {
            ans = min(ans, abs(pref[i]-suff[i + 1]));
        }
        cout<<ans<<el;
    } else if (zeroes == 0)
    {
        if (twos)
        {
            ll f = twos / 2, s = (twos + 1) / 2;
            cout << (1ll << s) - (1ll << f) << el;
        }
        else
        {
            cout << 0 << el;
        }
    }
    else if (zeroes == 1)
    {
        if (ones)
            cout << 1 << el;
        else if (twos)
            cout << 2 << el;
        else
            cout << 0 << el;
    }
    else
    {
        cout << 0 << el;
    }
}
int main()
{
    fast;
    int tc = 1;
    // cin >> tc;
    while (tc--)
    {
        solve();
    }
}