#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i =a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define fo(i, n) rep(i, 0, n)
#define F first
#define S second
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vector<ll>> vvll;

const int NMAX = 112345;


int n,d;
ll ina[112345];
ll *in[NMAX];
void ok(ll out)
{
	printf("%lld\n", out);
	exit(0);
}
void fail(){ok(-1);}

ll dist(ll *a, ll *b)
{
	ll out=0;
	fo(i,d) out += abs(a[i]-b[i]);
	return out;

}

signed main() {
	scanf("%d%d", &n, &d);
	fo(i,n) in[i] = ina + d*i;
	fo(i,n) fo(j, d) scanf("%lld", in[i]+j);

	if(n<=2) ok(0);
	int a=0,b=1;
	for(int i=2; i<n;i++)
	{
		int A = dist(in[a],in[b]);
		int B = dist(in[a],in[i]);
		int C = dist(in[b],in[i]);
		if(A == B+C) continue;
		else if(B == A+C)
			b=i;
		else if(C == A+B)
			a=i;
		else fail();
	}

	ll * first_point = in[a];

	sort(in, in+n, [&](ll *x, ll *y){
			return dist(first_point,x) < dist(first_point,y);
			return a<b;
			});

	ll out=0;
	ll maxd=0;
	fo(j, d)
	{
		bool klesa=1, stoupe=1;
		fo(i,n-1)
		{
			if(in[i][j] < in[i+1][j]) klesa=false;
			if(in[i][j] > in[i+1][j]) stoupe=false;
		}
		if(!klesa && !stoupe) fail();
		ll val=0;
		fo(i,n)
			val += abs(in[i][j] - in[n/2][j]);
		out += val;
		maxd = max(maxd, val);
	}

	printf("%lld\n", 2*(out-maxd));
}