#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl

const int M = 1000000007;;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}



//_ ***************************** START Below *******************************



int nCr(int n, int r){
    if(r<0 || r>n) return 0;
    if(r > n-r) r = n-r;

    int res = 1;
    for(int k=1; k<=r; k++){
        res *= (n-k+1);
        res /= k;
    }

    return res;

}

vector<vector<int>> a;

int consistency(int m, int n){

    int ans = m*n; //* All single element sequences 

    //* row wise 2 sized, 3 sized ,,, sequences of 0 & 1 colors
    for(int i=0; i<m; i++){
        int ones = 0;
        int zeroes = 0;
        for(int j=0; j<n; j++){
            if(a[i][j] == 0) zeroes++;
            else ones++;
        }
        for(int k=2; k<=zeroes; k++){
            ans += nCr(zeroes, k);
        }
        for(int k=2; k<=ones; k++){
            ans += nCr(ones, k);
        }
    }
    
    //* col wise 2 sized, 3 sized ,,, sequences of 0 & 1 colors
    for(int j=0; j<n; j++){
        int ones = 0;
        int zeroes = 0;
        for(int i=0; i<m; i++){
            if(a[i][j] == 0) zeroes++;
            else ones++;
        }
        for(int k=2; k<=zeroes; k++){
            ans += nCr(zeroes, k);
        }
        for(int k=2; k<=ones; k++){
            ans += nCr(ones, k);
        }
    }

    return ans;
}















int practice(int m, int n){


    return 0;
}





void solve() {
    
    int m, n;
    cin >> m >> n;
    a.resize(m, vector<int>(n, 0));
    for(int i=0; i<m; i++){
        for(int j=0; j<n; j++) cin >> a[i][j];
    }
    
    cout << consistency(m, n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}