#include <bits/stdc++.h>

#define int long long
#define vec vector
#define forn(i, n) for(int i = 0;i<n;i++)
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define read(a) forn(i, (a).size()) cin>>(a)[i]
#define write(a) forn(i, (a).size()) cout<<(a)[i] << " "; cout << "\n";



using namespace std;

typedef pair<int, int> pii;

int inf = 1e17;

bool comp(vec<int> &a, vec<int> &b){
    int sum1 = 0;
    int sum2 = 0;
    for(int i=0;i<a.size();i++){
        sum1+=a[i];
        sum2+=b[i];
    }
    return sum1<sum2;
}

int loc_solve(vec<vec<int>> &tab,int n,int d){
    sort(all(tab),comp);
    vec<int> ans(d);
    for(int i=0;i<n;i++){
        for(int j=0;j<d;j++){
            if(i>0&&tab[i][j]<tab[i-1][j])
                return -1;
            ans[j]+=abs(tab[i][j] - tab[n/2][j])*2;
        }
    }
    int ret = 0;
    int mx = -1;
    for(int i=0;i<d;i++){
        ret += ans[i];
        mx = max(mx,ans[i]);
    }
    return ret-mx;
}

void solve(){
    int n,d;
    cin>>n>>d;
    vec<vec<int>> tab(n,vec<int>(d));
    for(int i=0;i<n;i++){
        for(int j=0;j<d;j++){
            cin>>tab[i][j];
        }
    }
    vec<int> max_d(d,-1*inf);
    vec<int> min_d(d,inf);
    for(int j=0;j<d;j++){
        for(int i=0;i<n;i++){
            min_d[j] = min(min_d[j],tab[i][j]);
            max_d[j] = max(max_d[j],tab[i][j]);
        }
    }
    vec<int> mn(d);
    int pi = -1;
    for(int i=0;i<n;i++){
        bool flag = true;
        for(int j=0;j<d;j++){
            if(tab[i][j]==min_d[j])
                mn[j] = 1;
            else if(tab[i][j]==max_d[j])
                mn[j] = -1;
            else{
                flag = false;
                break;
            }
        }
        if(flag){
            pi = i;
            break;
        }
    }
    if(pi>=0){
        for(int i=0;i<n;i++){
            for(int j=0;j<d;j++){
                tab[i][j] *= mn[j];
            }
        }
        int ans = loc_solve(tab,n,d);
        cout<<ans<<'\n';
    }
    else{
        cout<<-1<<'\n';
        return;
    }
}

signed main()
{
    int tt = 1;
    while(tt--){
        solve();
    }
}