#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;


// 1-indexed

bool cmp(const pii& a, const pii&b){
    if(a.first == b.first){
        return a.second < b.second;
    }

    return a.first < b.first;
}

int main() {
    //cout << fixed << setprecision(15);
    int r, c;
    while(cin >> r >> c){
        if(r==0&&c==0) break;

        vector<vector<int>> v(10);
        int R[15]={0};
        int C[10010]={0};
        REP(i, r){
            REP(j, c){
                int a = readInt();
                v[i].push_back(a);
            }
        }

        for(int i=0; i<r; ++i){
            for(int j=0; j<c; ++j){
                if(v[i][j]==0){
                    R[i]++;
                    C[j]++;
                }
            }
        }

        int ans=0;
        for(int bit=0; bit<(1<<r); ++bit){
            vector<int> G;
            for(int i=0; i<r; ++i){
                if(bit>>i & 1){
                    G.push_back(i);
                }
            }
            int cnt=0;

            for(int i=0; i<c; ++i){
                //C[i] : R-C[i]
                int t=0; //0 -> 1の数
                int s=0; //1 -> 0の数
                for(int j=0; j<G.size(); ++j){
                    if(v[G[j]][i] == 0){
                        t++;
                    }else{
                        s++;
                    }
                }
                cnt += max(C[i]+s-t, r-C[i]+t-s);
            }
            ans = max(ans, cnt);
        }
        cout << ans << endl;
    }

}


Measured memory_bytes: 3388