#include <stdio.h>
#include <stdlib.h>

#define INF 1000000000000000LL

int cmp_ll (const void *ap, const void *bp) {
  long long a = *(long long *)ap;
  long long b = *(long long *)bp;
  
  if (a < b) {
    return -1;
  }
  
  if (a > b) {
    return 1;
  }
  
  return 0;
}

int main () {
  int n = 0;
  int m = 0;
  long long d[1500][1500] = {};
  
  int res = 0;
  
  long long dp[1500][1500] = {};
  long long ans = INF;
  
  res = scanf("%d", &n);
  res = scanf("%d", &m);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      res = scanf("%lld", d[i]+j);
    }
    qsort(d[i], m, sizeof(long long), cmp_ll);
  }
  
  for (int i = 1; i < n; i++) {
    int idx = -1;
    for (int j = 0; j < m; j++) {
      if (dp[i-1][j] < INF) {
        dp[i-1][j] -= d[i-1][j];
      }
    }
    for (int j = 1; j < m; j++) {
      if (dp[i-1][j] > dp[i-1][j-1]) {
        dp[i-1][j] = dp[i-1][j-1];
      }
    }
    for (int j = 0; j < m; j++) {
      while (idx < m-1 && d[i][j] >= d[i-1][idx+1]) {
        idx++;
      }
      if (idx < 0) {
        dp[i][j] = INF;
      } else {
        dp[i][j] = dp[i-1][idx]+d[i][j];
      }
    }
  }
  
  for (int i = 0; i < m; i++) {
    if (ans > dp[n-1][i]) {
      ans = dp[n-1][i];
    }
  }
  
  if (ans >= INF) {
    printf("-1\n");
  } else {
    printf("%lld\n", ans);
  }
  
  return 0;
}