#include<iostream> #include<string> #include<iomanip> #include<cmath> #include<vector> #include<algorithm> #include<utility> using namespace std; #define int long long #define endl "\n" constexpr long long INF = (long long)1e18; constexpr long long MOD = 1'000'000'007; struct fast_io { fast_io(){ std::cin.tie(nullptr); std::ios::sync_with_stdio(false); }; } fio; int ans; int N, M; vector<vector<int>> A; vector<vector<int>> X; vector<int> used; int rec(int depth = 0){ //cout<<depth<<endl; if(depth == N) { int sum = 0; for(int j = 0; j < M; j++){ sum += (X[0][j] * X[0][j]) - (X[1][j] * X[1][j]); } ans = max(ans, sum); return sum; } else { // if(depth%2 == 0 && ans < sum) return -INF; } int maximum = -INF, minimum = INF; for(int i = 0; i < N; i++){ if(used[i]) continue; used[i] = true; // X[depth][i] for(int j = 0; j < M; j++){ X[depth%2][j] += A[i][j]; } int temp = rec(depth+1); maximum = max(temp, maximum); minimum = min(temp, minimum); for(int j = 0; j < M; j++){ X[depth%2][j] -= A[i][j]; } used[i] = false; } if(depth%2 == 0) return maximum; return minimum; } signed main(){ cout<<fixed<<setprecision(10); cin>>N>>M; A.resize(N, vector<int>(M)); X.resize(2, vector<int>(M)); used.resize(N); for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ cin>>A[i][j]; } } ans = rec(); cout<<ans<<endl; return 0; }