#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 2e18;
const ll fact_table = 1200008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
  
ll mypow(ll number1,ll number2, ll mod){
    if(number2 == 0){
        return 1ll;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 

ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}

bool multicase = false;

ll n,m,num,a,b,c,d,e,h,q;
ll w, k;
ll x[500005], y[500005];
ll z[500005];
ll table[1005][105];
bool used[500005];
vector<ll> take[2];

ll dfs(ll v){
    if(v == n + 1){
        ll res = 0;
        for(ll i=0;i<2;i++){
            // 0: 相手　1: 自分
            ll tmp = 0;
            for(ll j=0;j<m;j++){
                z[j] = 0;
            }
            for(ll j=0;j<n/2;j++){
                for(ll k=0;k<m;k++){
                    z[k] += table[take[i][j]][k];
                }
            }
            for(ll k=0;k<m;k++){
                tmp += z[k] * z[k];
            }
            if(i == 0)res -= tmp;
            if(i == 1)res += tmp;
        }
        return res;
    }
    ll flip = 1;
    if(v % 2 == 1){
        // 最大化したい
        ll res = -INF;
        for(ll i=0;i<n;i++){
            if(used[i])continue;
            used[i] = true;
            take[v%2].pb(i);
            res = max(res, dfs(v+1));
            used[i] = false;
            take[v%2].pop_back();
        }
        return res;
    }else{
        ll res = INF;
        for(ll i=0;i<n;i++){
            if(used[i])continue;
            used[i] = true;
            take[v%2].pb(i);
            res = min(res, dfs(v+1));
            used[i] = false;
            take[v%2].pop_back();
        }
        return res;
    }
}




void solve(){
    cin >> n >> m;
    assert(n % 2 == 0);
    assert(2 <= n && n <= 1000);
    assert(1 <= m && m <= 100);
    for(ll i=0;i<n;i++){
        for(ll j=0;j<m;j++){

            cin >> table[i][j];
            assert(0 <= table[i][j] && table[i][j] <= 100);
        }
    }

    ll ans = dfs(1);
    p(ans);
    return;
}


int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}